./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:35:53,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:35:53,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:35:53,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:35:53,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:35:53,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:35:53,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:35:53,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:35:53,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:35:53,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:35:53,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:35:53,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:35:53,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:35:53,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:35:53,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:35:53,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:35:53,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:35:53,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:35:53,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:35:53,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:35:53,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:35:53,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:35:53,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:35:53,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:35:53,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:35:53,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:35:53,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:35:53,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:35:53,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:35:53,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:35:53,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:35:53,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:35:53,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:35:53,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:35:53,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:35:53,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:35:53,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:35:53,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:35:53,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:35:53,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:35:53,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:35:53,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:35:53,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:35:53,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:35:53,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:35:53,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:35:53,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:35:53,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:35:53,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:35:53,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:35:53,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:35:53,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:35:53,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:35:53,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:35:53,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:35:53,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:35:53,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:35:53,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:35:53,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:35:53,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:35:53,250 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:35:53,251 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:35:53,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:35:53,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:35:53,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:35:53,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:35:53,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:35:53,252 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:35:53,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:35:53,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:35:53,253 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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2021-11-23 01:35:53,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:35:53,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:35:53,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:35:53,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:35:53,618 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:35:53,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-11-23 01:35:53,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/data/40953afb6/17595d86089d41408903209e65d42051/FLAGbe9842c30 [2021-11-23 01:35:54,251 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:35:54,252 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-11-23 01:35:54,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/data/40953afb6/17595d86089d41408903209e65d42051/FLAGbe9842c30 [2021-11-23 01:35:54,570 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/data/40953afb6/17595d86089d41408903209e65d42051 [2021-11-23 01:35:54,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:35:54,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:35:54,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:35:54,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:35:54,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:35:54,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:54,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747f2f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54, skipping insertion in model container [2021-11-23 01:35:54,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:54,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:35:54,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:35:54,883 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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2021-11-23 01:35:54,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:35:54,900 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:35:54,971 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_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2021-11-23 01:35:54,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:35:54,987 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:35:54,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54 WrapperNode [2021-11-23 01:35:54,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:35:54,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:35:54,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:35:54,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:35:55,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,070 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 467 [2021-11-23 01:35:55,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:35:55,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:35:55,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:35:55,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:35:55,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:35:55,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:35:55,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:35:55,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:35:55,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:54" (1/1) ... [2021-11-23 01:35:55,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:35:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:35:55,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:35:55,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:35:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:35:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:35:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:35:55,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:35:55,347 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:35:55,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:35:56,027 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:35:56,641 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:35:56,642 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:35:56,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:56 BoogieIcfgContainer [2021-11-23 01:35:56,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:35:56,646 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:35:56,646 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:35:56,661 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:35:56,662 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:56" (1/1) ... [2021-11-23 01:35:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:35:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:35:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 01:35:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 01:35:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 01:35:56,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:35:56,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:35:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:35:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:35:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:35:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2021-11-23 01:35:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2021-11-23 01:35:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 01:35:57,536 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:35:57,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:35:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:35:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:35:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:35:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2021-11-23 01:35:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2021-11-23 01:35:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:35:58,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:35:58,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:35:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:35:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:35:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:35:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2021-11-23 01:35:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-11-23 01:35:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:35:58,851 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:35:58,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:35:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:35:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:35:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:35:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2021-11-23 01:35:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2021-11-23 01:35:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 01:35:59,665 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:35:59,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:35:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:35:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 39 states and 69 transitions. [2021-11-23 01:36:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2021-11-23 01:36:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 01:36:00,866 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:00,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 45 states and 80 transitions. [2021-11-23 01:36:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2021-11-23 01:36:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 01:36:02,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:02,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 46 states and 81 transitions. [2021-11-23 01:36:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2021-11-23 01:36:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:36:02,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:02,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 47 states and 82 transitions. [2021-11-23 01:36:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2021-11-23 01:36:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:36:02,518 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:02,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 57 states and 99 transitions. [2021-11-23 01:36:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2021-11-23 01:36:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 01:36:04,434 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:04,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 60 states and 105 transitions. [2021-11-23 01:36:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 105 transitions. [2021-11-23 01:36:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 01:36:04,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:04,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 76 states and 137 transitions. [2021-11-23 01:36:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2021-11-23 01:36:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:36:09,354 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:09,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:09,553 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 01:36:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 90 states and 161 transitions. [2021-11-23 01:36:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 161 transitions. [2021-11-23 01:36:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:36:12,406 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:12,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:12,546 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 01:36:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 91 states and 163 transitions. [2021-11-23 01:36:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2021-11-23 01:36:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:36:12,837 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:12,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 99 states and 182 transitions. [2021-11-23 01:36:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 182 transitions. [2021-11-23 01:36:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:36:15,444 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:15,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 101 states and 188 transitions. [2021-11-23 01:36:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 188 transitions. [2021-11-23 01:36:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:36:16,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:16,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 102 states and 192 transitions. [2021-11-23 01:36:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 192 transitions. [2021-11-23 01:36:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:36:16,774 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:16,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:17,151 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 01:36:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 110 states and 214 transitions. [2021-11-23 01:36:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 214 transitions. [2021-11-23 01:36:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:36:20,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:20,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:20,308 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 01:36:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 111 states and 215 transitions. [2021-11-23 01:36:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 215 transitions. [2021-11-23 01:36:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:36:20,789 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:20,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:20,907 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 01:36:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 113 states and 222 transitions. [2021-11-23 01:36:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 222 transitions. [2021-11-23 01:36:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:36:21,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:21,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:21,707 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 01:36:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 114 states and 224 transitions. [2021-11-23 01:36:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 224 transitions. [2021-11-23 01:36:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:22,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:22,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:23,028 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 01:36:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 128 states and 254 transitions. [2021-11-23 01:36:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 254 transitions. [2021-11-23 01:36:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:29,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:29,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:29,801 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 01:36:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 131 states and 261 transitions. [2021-11-23 01:36:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 261 transitions. [2021-11-23 01:36:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:31,200 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:31,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:31,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 01:36:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 132 states and 262 transitions. [2021-11-23 01:36:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 262 transitions. [2021-11-23 01:36:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:32,288 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:32,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:32,607 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 01:36:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 133 states and 263 transitions. [2021-11-23 01:36:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 263 transitions. [2021-11-23 01:36:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:33,226 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:33,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:33,601 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 01:36:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 134 states and 264 transitions. [2021-11-23 01:36:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 264 transitions. [2021-11-23 01:36:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:36:34,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:34,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:34,612 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 01:36:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 135 states and 265 transitions. [2021-11-23 01:36:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 265 transitions. [2021-11-23 01:36:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 01:36:35,192 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:35,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:35,720 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 01:36:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 149 states and 287 transitions. [2021-11-23 01:36:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 287 transitions. [2021-11-23 01:36:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:36:40,815 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:40,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:41,995 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 01:36:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 157 states and 302 transitions. [2021-11-23 01:36:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 302 transitions. [2021-11-23 01:36:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:36:46,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:46,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:36:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:36:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 172 states and 350 transitions. [2021-11-23 01:36:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 350 transitions. [2021-11-23 01:36:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:36:55,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:36:55,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:36:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:36:56,197 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 01:37:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 185 states and 379 transitions. [2021-11-23 01:37:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 379 transitions. [2021-11-23 01:37:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:37:01,004 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:01,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:01,146 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 01:37:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 186 states and 380 transitions. [2021-11-23 01:37:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 380 transitions. [2021-11-23 01:37:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:37:01,953 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:01,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:02,113 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 01:37:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 187 states and 382 transitions. [2021-11-23 01:37:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 382 transitions. [2021-11-23 01:37:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:37:02,741 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:02,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:03,911 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 01:37:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 197 states and 401 transitions. [2021-11-23 01:37:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 401 transitions. [2021-11-23 01:37:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:37:08,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:08,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:08,907 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 01:37:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 199 states and 404 transitions. [2021-11-23 01:37:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 404 transitions. [2021-11-23 01:37:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:37:09,870 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:09,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:37:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 208 states and 422 transitions. [2021-11-23 01:37:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 422 transitions. [2021-11-23 01:37:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:37:15,297 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:15,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:37:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 210 states and 430 transitions. [2021-11-23 01:37:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 430 transitions. [2021-11-23 01:37:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:37:16,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:16,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:37:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 212 states and 432 transitions. [2021-11-23 01:37:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 432 transitions. [2021-11-23 01:37:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:37:17,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:17,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:37:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 214 states and 439 transitions. [2021-11-23 01:37:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 439 transitions. [2021-11-23 01:37:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:37:19,392 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:19,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:21,118 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 01:37:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 225 states and 467 transitions. [2021-11-23 01:37:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 467 transitions. [2021-11-23 01:37:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:37:30,009 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:30,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:30,352 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 01:37:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 228 states and 476 transitions. [2021-11-23 01:37:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 476 transitions. [2021-11-23 01:37:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:37:32,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:32,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:32,957 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 01:37:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 232 states and 483 transitions. [2021-11-23 01:37:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 483 transitions. [2021-11-23 01:37:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:37:35,762 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:35,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:37,016 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 01:37:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 240 states and 504 transitions. [2021-11-23 01:37:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 504 transitions. [2021-11-23 01:37:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:37:43,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:43,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:43,297 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 01:37:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 244 states and 515 transitions. [2021-11-23 01:37:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 515 transitions. [2021-11-23 01:37:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:37:45,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:45,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:46,157 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 01:37:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 250 states and 527 transitions. [2021-11-23 01:37:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 527 transitions. [2021-11-23 01:37:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:37:50,239 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:50,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:50,443 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 01:37:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 253 states and 530 transitions. [2021-11-23 01:37:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 530 transitions. [2021-11-23 01:37:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:37:52,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:52,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:52,977 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 01:37:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 254 states and 533 transitions. [2021-11-23 01:37:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 533 transitions. [2021-11-23 01:37:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 01:37:53,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:53,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:37:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:37:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 254 states and 532 transitions. [2021-11-23 01:37:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 532 transitions. [2021-11-23 01:37:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:37:54,386 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:37:54,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:37:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:37:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 263 states and 553 transitions. [2021-11-23 01:38:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 553 transitions. [2021-11-23 01:38:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:38:05,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:05,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 270 states and 566 transitions. [2021-11-23 01:38:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 566 transitions. [2021-11-23 01:38:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:38:11,344 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:11,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 273 states and 569 transitions. [2021-11-23 01:38:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 569 transitions. [2021-11-23 01:38:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:38:14,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:14,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 277 states and 582 transitions. [2021-11-23 01:38:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 582 transitions. [2021-11-23 01:38:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:38:17,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:17,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 279 states and 584 transitions. [2021-11-23 01:38:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 584 transitions. [2021-11-23 01:38:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:38:19,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:19,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:38:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 280 states and 585 transitions. [2021-11-23 01:38:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 585 transitions. [2021-11-23 01:38:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 01:38:20,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:20,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:38:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:38:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:38:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 280 states and 584 transitions. [2021-11-23 01:38:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 584 transitions. [2021-11-23 01:38:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:38:21,476 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:38:21,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:38:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:38:21,971 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:38:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:38:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:38:23,459 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:38:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:38:24,072 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2021-11-23 01:38:24,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:38:24 ImpRootNode [2021-11-23 01:38:24,319 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:38:24,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:38:24,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:38:24,320 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:38:24,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:56" (3/4) ... [2021-11-23 01:38:24,322 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:38:24,528 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:38:24,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:38:24,529 INFO L158 Benchmark]: Toolchain (without parser) took 149952.67ms. Allocated memory was 90.2MB in the beginning and 1.1GB in the end (delta: 992.0MB). Free memory was 53.5MB in the beginning and 414.8MB in the end (delta: -361.3MB). Peak memory consumption was 632.3MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,530 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:38:24,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 90.2MB. Free memory was 53.3MB in the beginning and 59.6MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.86ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 56.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,531 INFO L158 Benchmark]: Boogie Preprocessor took 81.05ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 54.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,532 INFO L158 Benchmark]: RCFGBuilder took 1492.34ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 54.1MB in the beginning and 50.8MB in the end (delta: 3.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,532 INFO L158 Benchmark]: CodeCheck took 147673.31ms. Allocated memory was 121.6MB in the beginning and 1.1GB in the end (delta: 960.5MB). Free memory was 49.9MB in the beginning and 434.9MB in the end (delta: -385.0MB). Peak memory consumption was 575.4MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,533 INFO L158 Benchmark]: Witness Printer took 208.85ms. Allocated memory is still 1.1GB. Free memory was 434.9MB in the beginning and 414.8MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 01:38:24,536 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: 147.4s, OverallIterations: 55, 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, 19254 SdHoareTripleChecker+Valid, 143.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17373 mSDsluCounter, 6057 SdHoareTripleChecker+Invalid, 127.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5177 mSDsCounter, 6426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51344 IncrementalHoareTripleChecker+Invalid, 57770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6426 mSolverCounterUnsat, 880 mSDtfsCounter, 51344 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15230 GetRequests, 13382 SyntacticMatches, 906 SemanticMatches, 942 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503546 ImplicationChecksByTransitivity, 127.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1593 NumberOfCodeBlocks, 1593 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 19939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 12 PerfectInterpolantSequences, 230/951 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: 585]: 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] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND FALSE !(\read(r131)) [L278] tmp = 0 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND FALSE !(\read(r121)) [L291] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND FALSE !(\read(ep31)) [L301] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [c1=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=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=-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] [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=5, max1=3, max2=6, max3=4, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=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=6, 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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND TRUE (int )m3 > (int )max3 [L208] max3 = m3 [L209] newmax = (_Bool)1 [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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 )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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 )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=6, max1=3, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=-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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=-1, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=-1, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=-1, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L585] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=3, id2=6, id3=4, m1=2, m2=7, m3=-1, max1=3, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 90.2MB. Free memory was 53.3MB in the beginning and 59.6MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.86ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 56.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.05ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 54.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1492.34ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 54.1MB in the beginning and 50.8MB in the end (delta: 3.3MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * CodeCheck took 147673.31ms. Allocated memory was 121.6MB in the beginning and 1.1GB in the end (delta: 960.5MB). Free memory was 49.9MB in the beginning and 434.9MB in the end (delta: -385.0MB). Peak memory consumption was 575.4MB. Max. memory is 16.1GB. * Witness Printer took 208.85ms. Allocated memory is still 1.1GB. Free memory was 434.9MB in the beginning and 414.8MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:38:24,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb02e9bf-7ed3-4ddf-ad66-8e8fdeaca252/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