./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:05:15,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:05:15,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:05:15,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:05:15,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:05:15,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:05:15,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:05:15,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:05:15,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:05:15,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:05:15,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:05:15,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:05:15,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:05:15,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:05:15,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:05:15,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:05:15,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:05:15,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:05:15,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:05:15,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:05:15,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:05:15,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:05:15,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:05:15,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:05:15,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:05:15,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:05:15,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:05:15,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:05:15,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:05:15,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:05:15,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:05:15,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:05:15,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:05:15,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:05:15,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:05:15,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:05:15,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:05:15,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:05:15,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:05:15,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:05:15,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:05:15,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:05:15,454 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:05:15,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:05:15,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:05:15,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:05:15,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:05:15,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:05:15,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:05:15,459 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:05:15,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:05:15,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:05:15,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:05:15,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:05:15,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:05:15,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:05:15,467 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:05:15,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:05:15,467 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:05:15,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:05:15,468 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:05:15,468 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:05:15,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:05:15,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:05:15,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:05:15,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:05:15,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:05:15,469 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:05:15,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:05:15,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:05:15,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2021-11-23 01:05:15,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:05:15,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:05:15,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:05:15,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:05:15,751 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:05:15,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-11-23 01:05:15,820 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/data/8f315c00d/f18211d711a4472a9d70888a11503380/FLAG6cc1ce17d [2021-11-23 01:05:16,333 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:05:16,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-11-23 01:05:16,342 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/data/8f315c00d/f18211d711a4472a9d70888a11503380/FLAG6cc1ce17d [2021-11-23 01:05:16,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/data/8f315c00d/f18211d711a4472a9d70888a11503380 [2021-11-23 01:05:16,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:05:16,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:05:16,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:05:16,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:05:16,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:05:16,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:16" (1/1) ... [2021-11-23 01:05:16,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf7941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:16, skipping insertion in model container [2021-11-23 01:05:16,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:16" (1/1) ... [2021-11-23 01:05:16,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:05:16,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:05:16,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-11-23 01:05:16,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:05:16,966 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:05:17,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-11-23 01:05:17,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:05:17,073 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:05:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17 WrapperNode [2021-11-23 01:05:17,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:05:17,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:05:17,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:05:17,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:05:17,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,138 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2021-11-23 01:05:17,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:05:17,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:05:17,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:05:17,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:05:17,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:05:17,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:05:17,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:05:17,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:05:17,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:17" (1/1) ... [2021-11-23 01:05:17,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:05:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:05:17,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:05:17,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:05:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:05:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:05:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:05:17,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:05:17,376 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:05:17,377 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:05:17,643 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:05:18,096 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:05:18,097 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:05:18,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:18 BoogieIcfgContainer [2021-11-23 01:05:18,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:05:18,102 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:05:18,102 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:05:18,113 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:05:18,113 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:18" (1/1) ... [2021-11-23 01:05:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:05:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2021-11-23 01:05:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2021-11-23 01:05:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 01:05:18,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:18,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2021-11-23 01:05:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2021-11-23 01:05:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:05:18,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:18,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 18 states and 28 transitions. [2021-11-23 01:05:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2021-11-23 01:05:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:05:19,276 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:19,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-23 01:05:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-23 01:05:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:05:19,683 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:19,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 24 states and 40 transitions. [2021-11-23 01:05:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2021-11-23 01:05:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:05:20,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:20,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 34 states and 67 transitions. [2021-11-23 01:05:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 67 transitions. [2021-11-23 01:05:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 01:05:23,193 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:23,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 42 states and 84 transitions. [2021-11-23 01:05:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 84 transitions. [2021-11-23 01:05:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 01:05:25,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:25,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 50 states and 100 transitions. [2021-11-23 01:05:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 100 transitions. [2021-11-23 01:05:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 01:05:29,878 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:29,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 51 states and 106 transitions. [2021-11-23 01:05:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 106 transitions. [2021-11-23 01:05:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 01:05:30,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:30,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 52 states and 108 transitions. [2021-11-23 01:05:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 108 transitions. [2021-11-23 01:05:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:05:31,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:31,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 67 states and 150 transitions. [2021-11-23 01:05:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 150 transitions. [2021-11-23 01:05:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:37,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:37,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 72 states and 160 transitions. [2021-11-23 01:05:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 160 transitions. [2021-11-23 01:05:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:40,364 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:40,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 89 states and 204 transitions. [2021-11-23 01:05:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 204 transitions. [2021-11-23 01:05:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:48,104 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:48,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 94 states and 220 transitions. [2021-11-23 01:05:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 220 transitions. [2021-11-23 01:05:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:50,614 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:50,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 99 states and 227 transitions. [2021-11-23 01:05:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 227 transitions. [2021-11-23 01:05:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:52,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:52,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 105 states and 243 transitions. [2021-11-23 01:05:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 243 transitions. [2021-11-23 01:05:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:55,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:55,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 112 states and 266 transitions. [2021-11-23 01:05:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 266 transitions. [2021-11-23 01:05:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:58,721 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:58,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 113 states and 269 transitions. [2021-11-23 01:05:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 269 transitions. [2021-11-23 01:05:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:59,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:59,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:05:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 114 states and 272 transitions. [2021-11-23 01:05:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 272 transitions. [2021-11-23 01:05:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:05:59,824 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:59,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 115 states and 275 transitions. [2021-11-23 01:06:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 275 transitions. [2021-11-23 01:06:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 01:06:00,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:00,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 116 states and 276 transitions. [2021-11-23 01:06:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 276 transitions. [2021-11-23 01:06:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:06:00,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:00,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 01:06:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 116 states and 275 transitions. [2021-11-23 01:06:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 275 transitions. [2021-11-23 01:06:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:06:01,005 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:01,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 142 states and 369 transitions. [2021-11-23 01:06:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 369 transitions. [2021-11-23 01:06:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:06:32,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:32,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 150 states and 389 transitions. [2021-11-23 01:06:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 389 transitions. [2021-11-23 01:06:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:06:43,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:43,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 156 states and 406 transitions. [2021-11-23 01:06:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 406 transitions. [2021-11-23 01:06:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:06:53,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:53,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 157 states and 414 transitions. [2021-11-23 01:06:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 414 transitions. [2021-11-23 01:06:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:06:57,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:57,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 158 states and 419 transitions. [2021-11-23 01:07:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 419 transitions. [2021-11-23 01:07:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:07:02,344 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:02,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 174 states and 486 transitions. [2021-11-23 01:07:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 486 transitions. [2021-11-23 01:07:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:07:23,134 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:23,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 185 states and 507 transitions. [2021-11-23 01:07:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 507 transitions. [2021-11-23 01:07:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:07:34,213 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:34,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:08:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:08:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 210 states and 594 transitions. [2021-11-23 01:08:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 594 transitions. [2021-11-23 01:08:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:08:56,330 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:08:56,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:08:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:08:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:09:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 217 states and 614 transitions. [2021-11-23 01:09:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 614 transitions. [2021-11-23 01:09:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:09:09,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:09:09,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:09:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:09:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:09:19,460 WARN L227 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 208 DAG size of output: 178 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 01:10:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:10:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 229 states and 649 transitions. [2021-11-23 01:10:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 649 transitions. [2021-11-23 01:10:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:10:08,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:10:08,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:10:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:10:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:10:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:10:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 241 states and 677 transitions. [2021-11-23 01:10:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 677 transitions. [2021-11-23 01:10:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:10:47,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:10:47,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:10:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:10:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:11:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:11:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 247 states and 694 transitions. [2021-11-23 01:11:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 694 transitions. [2021-11-23 01:11:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:11:26,958 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:11:26,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:11:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:11:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:11:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:11:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 252 states and 702 transitions. [2021-11-23 01:11:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 702 transitions. [2021-11-23 01:11:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-23 01:11:41,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:11:41,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:11:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:11:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:11:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:11:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 253 states and 707 transitions. [2021-11-23 01:11:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 707 transitions. [2021-11-23 01:11:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:11:54,209 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:11:54,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:11:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:11:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 261 states and 746 transitions. [2021-11-23 01:12:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 746 transitions. [2021-11-23 01:12:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:12:13,998 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:13,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 269 states and 769 transitions. [2021-11-23 01:12:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 769 transitions. [2021-11-23 01:12:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:12:25,144 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:25,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 275 states and 780 transitions. [2021-11-23 01:12:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 780 transitions. [2021-11-23 01:12:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:12:36,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:36,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 281 states and 793 transitions. [2021-11-23 01:12:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 793 transitions. [2021-11-23 01:12:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:12:48,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:48,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 284 states and 800 transitions. [2021-11-23 01:12:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 800 transitions. [2021-11-23 01:12:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 01:12:51,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:51,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:12:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:12:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 285 states and 803 transitions. [2021-11-23 01:12:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 803 transitions. [2021-11-23 01:12:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:12:53,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:12:53,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:12:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:12:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:13:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:13:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 299 states and 864 transitions. [2021-11-23 01:13:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 864 transitions. [2021-11-23 01:13:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:13:33,320 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:13:33,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:13:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:13:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:13:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:13:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 301 states and 876 transitions. [2021-11-23 01:13:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 876 transitions. [2021-11-23 01:13:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:13:35,447 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:13:35,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:13:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:13:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:13:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:13:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 310 states and 900 transitions. [2021-11-23 01:13:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 900 transitions. [2021-11-23 01:13:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:13:51,302 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:13:51,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:13:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:13:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:13:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:13:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 311 states and 903 transitions. [2021-11-23 01:13:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 903 transitions. [2021-11-23 01:13:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:13:53,054 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:13:53,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:13:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:13:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:14:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:14:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 317 states and 915 transitions. [2021-11-23 01:14:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 915 transitions. [2021-11-23 01:14:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 01:14:03,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:14:03,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:14:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:14:04,507 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:14:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:14:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:14:05,119 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:14:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:14:05,510 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2021-11-23 01:14:05,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:14:05 ImpRootNode [2021-11-23 01:14:05,662 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:14:05,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:14:05,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:14:05,663 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:14:05,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:18" (3/4) ... [2021-11-23 01:14:05,665 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:14:05,842 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:14:05,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:14:05,843 INFO L158 Benchmark]: Toolchain (without parser) took 529149.25ms. Allocated memory was 102.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 314.8MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,844 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 102.8MB. Free memory was 58.2MB in the beginning and 58.1MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:14:05,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.53ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 74.6MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,845 INFO L158 Benchmark]: Boogie Preprocessor took 47.54ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 71.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:14:05,846 INFO L158 Benchmark]: RCFGBuilder took 912.09ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 70.8MB in the beginning and 87.2MB in the end (delta: -16.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,846 INFO L158 Benchmark]: CodeCheck took 527559.71ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 86.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,847 INFO L158 Benchmark]: Witness Printer took 180.31ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-23 01:14:05,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 527.4s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16049 SdHoareTripleChecker+Valid, 162.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15155 mSDsluCounter, 11977 SdHoareTripleChecker+Invalid, 148.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11613 mSDsCounter, 5373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48543 IncrementalHoareTripleChecker+Invalid, 53916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5373 mSolverCounterUnsat, 364 mSDtfsCounter, 48543 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18549 GetRequests, 16882 SyntacticMatches, 687 SemanticMatches, 980 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501542 ImplicationChecksByTransitivity, 482.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 47.4s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 65457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 5 PerfectInterpolantSequences, 425/1568 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 282]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] port_t p2 ; [L35] char p2_old ; [L36] char p2_new ; [L37] char id2 ; [L38] char st2 ; [L39] msg_t send2 ; [L40] _Bool mode2 ; [L41] port_t p3 ; [L42] char p3_old ; [L43] char p3_new ; [L44] char id3 ; [L45] char st3 ; [L46] msg_t send3 ; [L47] _Bool mode3 ; [L229] int c1 ; [L230] int i2 ; [L233] c1 = 0 [L234] r1 = __VERIFIER_nondet_char() [L235] id1 = __VERIFIER_nondet_char() [L236] st1 = __VERIFIER_nondet_char() [L237] send1 = __VERIFIER_nondet_char() [L238] mode1 = __VERIFIER_nondet_bool() [L239] id2 = __VERIFIER_nondet_char() [L240] st2 = __VERIFIER_nondet_char() [L241] send2 = __VERIFIER_nondet_char() [L242] mode2 = __VERIFIER_nondet_bool() [L243] id3 = __VERIFIER_nondet_char() [L244] st3 = __VERIFIER_nondet_char() [L245] send3 = __VERIFIER_nondet_char() [L246] mode3 = __VERIFIER_nondet_bool() [L247] CALL, EXPR init() [L128] int tmp ; [L131] COND TRUE (int )r1 == 0 [L132] COND TRUE (int )id1 >= 0 [L133] COND TRUE (int )st1 == 0 [L134] COND TRUE (int )send1 == (int )id1 [L135] COND TRUE (int )mode1 == 0 [L136] COND TRUE (int )id2 >= 0 [L137] COND TRUE (int )st2 == 0 [L138] COND TRUE (int )send2 == (int )id2 [L139] COND TRUE (int )mode2 == 0 [L140] COND TRUE (int )id3 >= 0 [L141] COND TRUE (int )st3 == 0 [L142] COND TRUE (int )send3 == (int )id3 [L143] COND TRUE (int )mode3 == 0 [L144] COND TRUE (int )id1 != (int )id2 [L145] COND TRUE (int )id1 != (int )id3 [L146] COND TRUE (int )id2 != (int )id3 [L147] tmp = 1 [L196] return (tmp); [L247] RET, EXPR init() [L247] i2 = init() [L248] COND FALSE !(!(i2)) [L249] p1_old = nomsg [L250] p1_new = nomsg [L251] p2_old = nomsg [L252] p2_new = nomsg [L253] p3_old = nomsg [L254] p3_new = nomsg [L255] i2 = 0 VAL [c1=0, i2=0, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=1, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 [L68] mode1 = (_Bool)0 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 [L93] mode2 = (_Bool)0 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 [L118] mode3 = (_Bool)0 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=2, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=3, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 [L68] mode1 = (_Bool)0 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND FALSE !((int )m2 > (int )id2) [L89] COND FALSE !((int )m2 == (int )id2) [L93] mode2 = (_Bool)0 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 [L118] mode3 = (_Bool)0 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=4, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND FALSE !(\read(mode1)) [L70] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND FALSE !(\read(mode2)) [L95] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND FALSE !(\read(mode3)) [L120] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=5, id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg [L58] COND TRUE (int )m1 != (int )nomsg [L59] COND FALSE !((int )m1 > (int )id1) [L62] COND TRUE (int )m1 == (int )id1 [L63] st1 = (char)1 [L68] mode1 = (_Bool)0 [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg [L85] COND TRUE (int )m2 != (int )nomsg [L86] COND FALSE !((int )m2 > (int )id2) [L89] COND TRUE (int )m2 == (int )id2 [L90] st2 = (char)1 [L93] mode2 = (_Bool)0 [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg [L110] COND TRUE (int )m3 != (int )nomsg [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 [L118] mode3 = (_Bool)0 [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L204] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L222] tmp = 0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0, tmp=0] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND TRUE ! arg VAL [\old(arg)=0, arg=0, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L282] reach_error() VAL [\old(arg)=0, arg=0, id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 102.8MB. Free memory was 58.2MB in the beginning and 58.1MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.53ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 74.6MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.54ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 71.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 912.09ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 70.8MB in the beginning and 87.2MB in the end (delta: -16.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * CodeCheck took 527559.71ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 86.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. * Witness Printer took 180.31ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:14:05,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f19cad70-f59a-4a50-852a-09ab58a07cb8/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE