./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.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_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/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_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/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_de4d8362-cb88-4d9c-a731-e08f716ffb14/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 f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:23:08,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:23:08,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:23:08,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:23:08,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:23:08,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:23:08,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:23:08,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:23:08,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:23:08,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:23:08,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:23:08,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:23:08,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:23:08,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:23:08,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:23:08,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:23:08,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:23:08,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:23:08,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:23:08,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:23:08,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:23:08,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:23:08,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:23:08,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:23:08,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:23:08,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:23:08,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:23:08,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:23:08,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:23:08,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:23:08,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:23:08,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:23:08,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:23:08,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:23:08,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:23:08,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:23:08,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:23:08,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:23:08,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:23:08,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:23:08,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:23:08,464 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:23:08,501 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:23:08,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:23:08,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:23:08,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:23:08,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:23:08,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:23:08,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:23:08,503 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:23:08,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:23:08,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:23:08,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:23:08,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:23:08,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:23:08,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:23:08,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:23:08,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:23:08,505 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:23:08,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:23:08,506 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:23:08,506 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:23:08,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:23:08,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:23:08,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:23:08,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:23:08,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:23:08,507 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:23:08,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:23:08,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:23:08,508 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_de4d8362-cb88-4d9c-a731-e08f716ffb14/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_de4d8362-cb88-4d9c-a731-e08f716ffb14/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 -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2021-11-23 00:23:08,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:23:08,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:23:08,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:23:08,812 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:23:08,813 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:23:08,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-11-23 00:23:08,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/data/c475ddde2/3e5cc15541b24714a806947ee7ad0bea/FLAGbad42d233 [2021-11-23 00:23:09,338 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:23:09,338 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-11-23 00:23:09,349 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/data/c475ddde2/3e5cc15541b24714a806947ee7ad0bea/FLAGbad42d233 [2021-11-23 00:23:09,691 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/data/c475ddde2/3e5cc15541b24714a806947ee7ad0bea [2021-11-23 00:23:09,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:23:09,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:23:09,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:23:09,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:23:09,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:23:09,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:09" (1/1) ... [2021-11-23 00:23:09,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1196c467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:09, skipping insertion in model container [2021-11-23 00:23:09,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:09" (1/1) ... [2021-11-23 00:23:09,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:23:09,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:23:10,027 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_de4d8362-cb88-4d9c-a731-e08f716ffb14/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2021-11-23 00:23:10,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:23:10,050 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:23:10,116 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_de4d8362-cb88-4d9c-a731-e08f716ffb14/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2021-11-23 00:23:10,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:23:10,132 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:23:10,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10 WrapperNode [2021-11-23 00:23:10,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:23:10,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:23:10,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:23:10,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:23:10,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,212 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2021-11-23 00:23:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:23:10,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:23:10,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:23:10,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:23:10,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:23:10,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:23:10,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:23:10,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:23:10,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:10" (1/1) ... [2021-11-23 00:23:10,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:23:10,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:23:10,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:23:10,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:23:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:23:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:23:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:23:10,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:23:10,459 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:23:10,460 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:23:11,124 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:23:11,747 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:23:11,747 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:23:11,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:11 BoogieIcfgContainer [2021-11-23 00:23:11,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:23:11,751 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:23:11,751 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:23:11,782 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:23:11,782 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:11" (1/1) ... [2021-11-23 00:23:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:23:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 00:23:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 00:23:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 00:23:11,847 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:11,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:12,511 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 00:23:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2021-11-23 00:23:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2021-11-23 00:23:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 00:23:12,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:12,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:12,911 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 00:23:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2021-11-23 00:23:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2021-11-23 00:23:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 00:23:13,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:13,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:13,355 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 00:23:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2021-11-23 00:23:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-11-23 00:23:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 00:23:13,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:13,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:13,967 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 00:23:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2021-11-23 00:23:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2021-11-23 00:23:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 00:23:14,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:14,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:14,843 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 00:23:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2021-11-23 00:23:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2021-11-23 00:23:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 00:23:15,727 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:15,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:16,065 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 00:23:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2021-11-23 00:23:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2021-11-23 00:23:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 00:23:17,137 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:17,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:17,239 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 00:23:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-11-23 00:23:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-11-23 00:23:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:23:17,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:17,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:17,543 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 00:23:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2021-11-23 00:23:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2021-11-23 00:23:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:23:17,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:17,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:17,809 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 00:23:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 57 states and 96 transitions. [2021-11-23 00:23:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2021-11-23 00:23:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 00:23:19,637 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:19,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:19,858 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 00:23:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 60 states and 101 transitions. [2021-11-23 00:23:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2021-11-23 00:23:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 00:23:20,113 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:20,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:20,840 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 00:23:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2021-11-23 00:23:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2021-11-23 00:23:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:23:25,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:25,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 89 states and 154 transitions. [2021-11-23 00:23:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 154 transitions. [2021-11-23 00:23:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:23:29,311 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:29,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:29,872 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 00:23:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 107 states and 185 transitions. [2021-11-23 00:23:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 185 transitions. [2021-11-23 00:23:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:23:34,514 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:34,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:34,782 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 00:23:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 109 states and 191 transitions. [2021-11-23 00:23:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 191 transitions. [2021-11-23 00:23:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:23:35,486 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:35,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 128 states and 223 transitions. [2021-11-23 00:23:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 223 transitions. [2021-11-23 00:23:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:23:42,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:42,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 131 states and 232 transitions. [2021-11-23 00:23:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 232 transitions. [2021-11-23 00:23:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:23:44,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 148 states and 258 transitions. [2021-11-23 00:23:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2021-11-23 00:23:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:23:53,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:53,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 151 states and 275 transitions. [2021-11-23 00:23:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 275 transitions. [2021-11-23 00:23:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:23:55,451 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:55,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 153 states and 280 transitions. [2021-11-23 00:23:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 280 transitions. [2021-11-23 00:23:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:23:56,891 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:56,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 158 states and 289 transitions. [2021-11-23 00:23:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 289 transitions. [2021-11-23 00:23:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:23:59,348 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:59,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 160 states and 294 transitions. [2021-11-23 00:24:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 294 transitions. [2021-11-23 00:24:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:24:00,683 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:00,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 162 states and 297 transitions. [2021-11-23 00:24:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 297 transitions. [2021-11-23 00:24:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:24:01,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:01,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 163 states and 298 transitions. [2021-11-23 00:24:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2021-11-23 00:24:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:24:02,789 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:02,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 171 states and 319 transitions. [2021-11-23 00:24:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 319 transitions. [2021-11-23 00:24:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:24:09,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:09,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 175 states and 330 transitions. [2021-11-23 00:24:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 330 transitions. [2021-11-23 00:24:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:24:11,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:11,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 176 states and 331 transitions. [2021-11-23 00:24:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 331 transitions. [2021-11-23 00:24:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:24:12,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:12,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 189 states and 367 transitions. [2021-11-23 00:24:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 367 transitions. [2021-11-23 00:24:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:24:20,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:20,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 191 states and 375 transitions. [2021-11-23 00:24:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 375 transitions. [2021-11-23 00:24:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:24:22,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:22,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 194 states and 383 transitions. [2021-11-23 00:24:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 383 transitions. [2021-11-23 00:24:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:24:25,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:25,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 196 states and 385 transitions. [2021-11-23 00:24:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 385 transitions. [2021-11-23 00:24:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:24:27,067 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:27,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 197 states and 387 transitions. [2021-11-23 00:24:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 387 transitions. [2021-11-23 00:24:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:24:28,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:28,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 208 states and 412 transitions. [2021-11-23 00:24:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 412 transitions. [2021-11-23 00:24:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:24:36,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:36,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 209 states and 413 transitions. [2021-11-23 00:24:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 413 transitions. [2021-11-23 00:24:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:24:38,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:38,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 209 states and 412 transitions. [2021-11-23 00:24:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 412 transitions. [2021-11-23 00:24:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:24:39,914 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:39,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 210 states and 414 transitions. [2021-11-23 00:24:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 414 transitions. [2021-11-23 00:24:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:24:40,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:40,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 210 states and 413 transitions. [2021-11-23 00:24:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 413 transitions. [2021-11-23 00:24:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:24:41,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:41,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 220 states and 431 transitions. [2021-11-23 00:24:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 431 transitions. [2021-11-23 00:24:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:24:48,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:48,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 221 states and 437 transitions. [2021-11-23 00:24:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 437 transitions. [2021-11-23 00:24:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:24:50,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:50,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 222 states and 438 transitions. [2021-11-23 00:24:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 438 transitions. [2021-11-23 00:24:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:24:51,685 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:51,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 222 states and 437 transitions. [2021-11-23 00:24:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 437 transitions. [2021-11-23 00:24:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:24:52,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:52,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 231 states and 455 transitions. [2021-11-23 00:24:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 455 transitions. [2021-11-23 00:24:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:24:59,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:59,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 232 states and 457 transitions. [2021-11-23 00:25:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 457 transitions. [2021-11-23 00:25:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:25:00,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:00,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 235 states and 466 transitions. [2021-11-23 00:25:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 466 transitions. [2021-11-23 00:25:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:25:03,133 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:03,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 230 states and 460 transitions. [2021-11-23 00:25:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 460 transitions. [2021-11-23 00:25:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:25:03,994 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:03,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 238 states and 481 transitions. [2021-11-23 00:25:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 481 transitions. [2021-11-23 00:25:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:25:13,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:13,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 242 states and 490 transitions. [2021-11-23 00:25:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 490 transitions. [2021-11-23 00:25:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:25:17,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:17,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 245 states and 499 transitions. [2021-11-23 00:25:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 499 transitions. [2021-11-23 00:25:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:25:19,901 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:19,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 249 states and 507 transitions. [2021-11-23 00:25:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 507 transitions. [2021-11-23 00:25:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:25:23,784 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:23,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 252 states and 513 transitions. [2021-11-23 00:25:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 513 transitions. [2021-11-23 00:25:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:25:26,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:26,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 255 states and 519 transitions. [2021-11-23 00:25:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 519 transitions. [2021-11-23 00:25:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:25:28,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:28,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 256 states and 522 transitions. [2021-11-23 00:25:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 522 transitions. [2021-11-23 00:25:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:29,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:29,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 261 states and 537 transitions. [2021-11-23 00:25:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 537 transitions. [2021-11-23 00:25:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:38,989 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:38,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 262 states and 539 transitions. [2021-11-23 00:25:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 539 transitions. [2021-11-23 00:25:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:40,763 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:40,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 263 states and 540 transitions. [2021-11-23 00:25:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 540 transitions. [2021-11-23 00:25:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:42,386 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:42,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 266 states and 547 transitions. [2021-11-23 00:25:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 547 transitions. [2021-11-23 00:25:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:44,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:44,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 267 states and 548 transitions. [2021-11-23 00:25:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 548 transitions. [2021-11-23 00:25:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:46,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:46,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 270 states and 556 transitions. [2021-11-23 00:25:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 556 transitions. [2021-11-23 00:25:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:25:49,011 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:49,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:25:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:25:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:25:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 271 states and 557 transitions. [2021-11-23 00:25:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 557 transitions. [2021-11-23 00:25:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 00:25:50,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:25:50,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:25:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:25:51,316 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:25:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:25:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:25:52,370 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:25:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:25:53,131 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 59 iterations. [2021-11-23 00:25:53,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:25:53 ImpRootNode [2021-11-23 00:25:53,422 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:25:53,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:25:53,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:25:53,425 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:25:53,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:11" (3/4) ... [2021-11-23 00:25:53,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:25:53,736 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:25:53,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:25:53,737 INFO L158 Benchmark]: Toolchain (without parser) took 164041.09ms. Allocated memory was 102.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 64.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-23 00:25:53,737 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 102.8MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:25:53,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.40ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 73.0MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.54ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 70.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,738 INFO L158 Benchmark]: Boogie Preprocessor took 49.17ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,738 INFO L158 Benchmark]: RCFGBuilder took 1477.67ms. Allocated memory was 102.8MB in the beginning and 136.3MB in the end (delta: 33.6MB). Free memory was 67.9MB in the beginning and 44.7MB in the end (delta: 23.3MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,739 INFO L158 Benchmark]: CodeCheck took 161670.87ms. Allocated memory was 136.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 44.7MB in the beginning and 551.4MB in the end (delta: -506.8MB). Peak memory consumption was 978.9MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,739 INFO L158 Benchmark]: Witness Printer took 311.86ms. Allocated memory is still 1.6GB. Free memory was 551.4MB in the beginning and 1.5GB in the end (delta: -902.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 00:25:53,741 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 161.3s, OverallIterations: 59, 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, 25223 SdHoareTripleChecker+Valid, 171.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23248 mSDsluCounter, 6353 SdHoareTripleChecker+Invalid, 152.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5405 mSDsCounter, 6178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61467 IncrementalHoareTripleChecker+Invalid, 67645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6178 mSolverCounterUnsat, 948 mSDtfsCounter, 61467 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17387 GetRequests, 15468 SyntacticMatches, 953 SemanticMatches, 966 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558033 ImplicationChecksByTransitivity, 132.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 12.1s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 1759 NumberOfCodeBlocks, 1759 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 28429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 10 PerfectInterpolantSequences, 211/1070 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: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND TRUE \read(r311) [L310] COND TRUE \read(ep12) [L311] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, i2=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 1 [L108] COND TRUE \read(ep12) [L109] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=4, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND FALSE !((int )r1 < 1) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L567] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 102.8MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.40ms. Allocated memory is still 102.8MB. Free memory was 64.5MB in the beginning and 73.0MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.54ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 70.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.17ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1477.67ms. Allocated memory was 102.8MB in the beginning and 136.3MB in the end (delta: 33.6MB). Free memory was 67.9MB in the beginning and 44.7MB in the end (delta: 23.3MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * CodeCheck took 161670.87ms. Allocated memory was 136.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 44.7MB in the beginning and 551.4MB in the end (delta: -506.8MB). Peak memory consumption was 978.9MB. Max. memory is 16.1GB. * Witness Printer took 311.86ms. Allocated memory is still 1.6GB. Free memory was 551.4MB in the beginning and 1.5GB in the end (delta: -902.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:25:53,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de4d8362-cb88-4d9c-a731-e08f716ffb14/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