./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:17:19,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:17:19,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:17:19,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:17:19,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:17:19,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:17:19,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:17:19,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:17:19,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:17:19,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:17:19,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:17:19,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:17:19,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:17:19,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:17:19,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:17:19,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:17:19,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:17:19,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:17:19,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:17:19,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:17:19,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:17:19,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:17:19,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:17:19,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:17:19,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:17:19,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:17:19,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:17:19,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:17:19,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:17:19,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:17:19,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:17:19,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:17:19,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:17:19,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:17:19,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:17:19,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:17:19,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:17:19,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:17:19,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:17:19,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:17:19,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:17:19,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 21:17:19,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:17:19,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:17:19,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:17:19,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:17:19,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:17:19,194 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:17:19,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:17:19,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:17:19,194 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:17:19,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:17:19,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:17:19,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:17:19,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:17:19,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:17:19,197 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:17:19,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:17:19,198 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:17:19,198 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/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_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-12-13 21:17:19,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:17:19,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:17:19,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:17:19,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:17:19,391 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:17:19,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-12-13 21:17:21,874 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:17:22,045 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:17:22,046 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/sv-benchmarks/c/systemc/kundu1.cil.c [2022-12-13 21:17:22,051 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/data/e8d0f2504/09c054650cde461583ca52596e67f51f/FLAG512f30f4a [2022-12-13 21:17:22,449 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/data/e8d0f2504/09c054650cde461583ca52596e67f51f [2022-12-13 21:17:22,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:17:22,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:17:22,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:17:22,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:17:22,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:17:22,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775b4f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22, skipping insertion in model container [2022-12-13 21:17:22,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:17:22,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:17:22,620 WARN L237 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_89a5d9f4-e9c9-4918-a4a5-bf431953118f/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-12-13 21:17:22,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:17:22,663 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:17:22,671 WARN L237 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_89a5d9f4-e9c9-4918-a4a5-bf431953118f/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-12-13 21:17:22,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:17:22,697 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:17:22,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22 WrapperNode [2022-12-13 21:17:22,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:17:22,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:17:22,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:17:22,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:17:22,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,725 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-12-13 21:17:22,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:17:22,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:17:22,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:17:22,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:17:22,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:17:22,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:17:22,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:17:22,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:17:22,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (1/1) ... [2022-12-13 21:17:22,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:17:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:22,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:17:22,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:17:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:17:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 21:17:22,809 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 21:17:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 21:17:22,810 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 21:17:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 21:17:22,810 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 21:17:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 21:17:22,810 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 21:17:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 21:17:22,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 21:17:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:17:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 21:17:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 21:17:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:17:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:17:22,880 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:17:22,882 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:17:23,166 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:17:23,172 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:17:23,172 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 21:17:23,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:23 BoogieIcfgContainer [2022-12-13 21:17:23,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:17:23,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:17:23,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:17:23,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:17:23,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:17:22" (1/3) ... [2022-12-13 21:17:23,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18284279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:23, skipping insertion in model container [2022-12-13 21:17:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:22" (2/3) ... [2022-12-13 21:17:23,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18284279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:23, skipping insertion in model container [2022-12-13 21:17:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:23" (3/3) ... [2022-12-13 21:17:23,180 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-12-13 21:17:23,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:17:23,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 21:17:23,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:17:23,243 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@220b3953, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:17:23,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 21:17:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 103 states have internal predecessors, (141), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 21:17:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 21:17:23,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:23,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:23,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1283588667, now seen corresponding path program 1 times [2022-12-13 21:17:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:23,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964324006] [2022-12-13 21:17:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:23,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 21:17:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 21:17:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964324006] [2022-12-13 21:17:23,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964324006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:23,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:23,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:17:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138183320] [2022-12-13 21:17:23,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:23,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:23,587 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 103 states have internal predecessors, (141), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:23,858 INFO L93 Difference]: Finished difference Result 359 states and 511 transitions. [2022-12-13 21:17:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:17:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-12-13 21:17:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:23,871 INFO L225 Difference]: With dead ends: 359 [2022-12-13 21:17:23,872 INFO L226 Difference]: Without dead ends: 231 [2022-12-13 21:17:23,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:23,879 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 321 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:23,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 732 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:17:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-13 21:17:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2022-12-13 21:17:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.4331210191082802) internal successors, (225), 165 states have internal predecessors, (225), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 21:17:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2022-12-13 21:17:23,942 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2022-12-13 21:17:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:23,943 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2022-12-13 21:17:23,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2022-12-13 21:17:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 21:17:23,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:23,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:23,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:17:23,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1434820870, now seen corresponding path program 1 times [2022-12-13 21:17:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:23,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776255497] [2022-12-13 21:17:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:23,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 21:17:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 21:17:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776255497] [2022-12-13 21:17:24,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776255497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:24,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:24,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:17:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319951741] [2022-12-13 21:17:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:24,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:17:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:17:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:24,088 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:24,268 INFO L93 Difference]: Finished difference Result 411 states and 568 transitions. [2022-12-13 21:17:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:17:24,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-12-13 21:17:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:24,272 INFO L225 Difference]: With dead ends: 411 [2022-12-13 21:17:24,272 INFO L226 Difference]: Without dead ends: 226 [2022-12-13 21:17:24,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:17:24,276 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 116 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:24,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 678 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-13 21:17:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2022-12-13 21:17:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.41875) internal successors, (227), 168 states have internal predecessors, (227), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 21:17:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2022-12-13 21:17:24,298 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2022-12-13 21:17:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:24,299 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2022-12-13 21:17:24,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2022-12-13 21:17:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 21:17:24,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:24,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:17:24,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1473943032, now seen corresponding path program 1 times [2022-12-13 21:17:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:24,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266070708] [2022-12-13 21:17:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 21:17:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 21:17:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:24,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266070708] [2022-12-13 21:17:24,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266070708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:24,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:17:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552538454] [2022-12-13 21:17:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:24,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:17:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:17:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:24,427 INFO L87 Difference]: Start difference. First operand 198 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:24,809 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2022-12-13 21:17:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:17:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-12-13 21:17:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:24,817 INFO L225 Difference]: With dead ends: 784 [2022-12-13 21:17:24,817 INFO L226 Difference]: Without dead ends: 596 [2022-12-13 21:17:24,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:17:24,819 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 508 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:24,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 805 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:17:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-12-13 21:17:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2022-12-13 21:17:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.3944636678200693) internal successors, (403), 297 states have internal predecessors, (403), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-12-13 21:17:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2022-12-13 21:17:24,851 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2022-12-13 21:17:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:24,851 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2022-12-13 21:17:24,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2022-12-13 21:17:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 21:17:24,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:24,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:24,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:17:24,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -24370336, now seen corresponding path program 1 times [2022-12-13 21:17:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:24,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739467680] [2022-12-13 21:17:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:24,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739467680] [2022-12-13 21:17:24,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739467680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:24,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:24,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:17:24,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905016602] [2022-12-13 21:17:24,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:24,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:24,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:24,907 INFO L87 Difference]: Start difference. First operand 353 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:25,135 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2022-12-13 21:17:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:25,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-12-13 21:17:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:25,141 INFO L225 Difference]: With dead ends: 1262 [2022-12-13 21:17:25,141 INFO L226 Difference]: Without dead ends: 919 [2022-12-13 21:17:25,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:25,143 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 308 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:25,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 789 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-12-13 21:17:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2022-12-13 21:17:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 640 states have (on average 1.334375) internal successors, (854), 648 states have internal predecessors, (854), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-12-13 21:17:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2022-12-13 21:17:25,201 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2022-12-13 21:17:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:25,201 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2022-12-13 21:17:25,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2022-12-13 21:17:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 21:17:25,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:25,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:25,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:17:25,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash -332809345, now seen corresponding path program 1 times [2022-12-13 21:17:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:25,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380924145] [2022-12-13 21:17:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:25,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380924145] [2022-12-13 21:17:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380924145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:25,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:17:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501349853] [2022-12-13 21:17:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:25,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:17:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:17:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:25,275 INFO L87 Difference]: Start difference. First operand 782 states and 1036 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:25,473 INFO L93 Difference]: Finished difference Result 1635 states and 2234 transitions. [2022-12-13 21:17:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:17:25,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-12-13 21:17:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:25,477 INFO L225 Difference]: With dead ends: 1635 [2022-12-13 21:17:25,477 INFO L226 Difference]: Without dead ends: 863 [2022-12-13 21:17:25,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:17:25,479 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:25,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 619 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-12-13 21:17:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 800. [2022-12-13 21:17:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 658 states have (on average 1.3191489361702127) internal successors, (868), 666 states have internal predecessors, (868), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-12-13 21:17:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2022-12-13 21:17:25,527 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2022-12-13 21:17:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:25,527 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2022-12-13 21:17:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2022-12-13 21:17:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 21:17:25,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:25,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:25,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:17:25,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -466822851, now seen corresponding path program 1 times [2022-12-13 21:17:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:25,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571885055] [2022-12-13 21:17:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571885055] [2022-12-13 21:17:25,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571885055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:25,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:25,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:17:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506841109] [2022-12-13 21:17:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:25,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:25,587 INFO L87 Difference]: Start difference. First operand 800 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:25,765 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2022-12-13 21:17:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-12-13 21:17:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:25,771 INFO L225 Difference]: With dead ends: 2356 [2022-12-13 21:17:25,771 INFO L226 Difference]: Without dead ends: 1567 [2022-12-13 21:17:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:25,773 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 184 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:25,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 443 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-12-13 21:17:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2022-12-13 21:17:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1259 states have (on average 1.289118347895155) internal successors, (1623), 1271 states have internal predecessors, (1623), 167 states have call successors, (167), 100 states have call predecessors, (167), 103 states have return successors, (233), 167 states have call predecessors, (233), 167 states have call successors, (233) [2022-12-13 21:17:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2022-12-13 21:17:25,858 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2022-12-13 21:17:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:25,858 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2022-12-13 21:17:25,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 21:17:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2022-12-13 21:17:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 21:17:25,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:25,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:25,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:17:25,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1537614413, now seen corresponding path program 1 times [2022-12-13 21:17:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:25,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488328690] [2022-12-13 21:17:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488328690] [2022-12-13 21:17:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488328690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:25,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:25,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:17:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785049293] [2022-12-13 21:17:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:25,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:25,901 INFO L87 Difference]: Start difference. First operand 1537 states and 2023 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:26,157 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2022-12-13 21:17:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-12-13 21:17:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:26,166 INFO L225 Difference]: With dead ends: 4093 [2022-12-13 21:17:26,166 INFO L226 Difference]: Without dead ends: 2700 [2022-12-13 21:17:26,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:26,170 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 180 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:26,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 369 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-12-13 21:17:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2022-12-13 21:17:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2131 states have (on average 1.278742374472079) internal successors, (2725), 2146 states have internal predecessors, (2725), 279 states have call successors, (279), 170 states have call predecessors, (279), 176 states have return successors, (398), 279 states have call predecessors, (398), 279 states have call successors, (398) [2022-12-13 21:17:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2022-12-13 21:17:26,339 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2022-12-13 21:17:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:26,339 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2022-12-13 21:17:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2022-12-13 21:17:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 21:17:26,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:26,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:26,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:17:26,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -663779837, now seen corresponding path program 1 times [2022-12-13 21:17:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:26,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122541100] [2022-12-13 21:17:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122541100] [2022-12-13 21:17:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122541100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:26,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:17:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927942059] [2022-12-13 21:17:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:26,387 INFO L87 Difference]: Start difference. First operand 2594 states and 3402 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:26,692 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2022-12-13 21:17:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-12-13 21:17:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:26,713 INFO L225 Difference]: With dead ends: 3062 [2022-12-13 21:17:26,713 INFO L226 Difference]: Without dead ends: 3058 [2022-12-13 21:17:26,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:26,716 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 170 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:26,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 376 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2022-12-13 21:17:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2022-12-13 21:17:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2423 states have (on average 1.2736277342137845) internal successors, (3086), 2439 states have internal predecessors, (3086), 311 states have call successors, (311), 190 states have call predecessors, (311), 197 states have return successors, (442), 311 states have call predecessors, (442), 311 states have call successors, (442) [2022-12-13 21:17:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2022-12-13 21:17:26,972 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2022-12-13 21:17:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:26,972 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2022-12-13 21:17:26,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2022-12-13 21:17:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 21:17:26,973 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:26,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:26,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:17:26,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash -472171120, now seen corresponding path program 1 times [2022-12-13 21:17:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:26,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874123378] [2022-12-13 21:17:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874123378] [2022-12-13 21:17:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874123378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:27,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:27,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657864672] [2022-12-13 21:17:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:27,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:27,025 INFO L87 Difference]: Start difference. First operand 2939 states and 3839 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:27,386 INFO L93 Difference]: Finished difference Result 5264 states and 6962 transitions. [2022-12-13 21:17:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2022-12-13 21:17:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:27,403 INFO L225 Difference]: With dead ends: 5264 [2022-12-13 21:17:27,403 INFO L226 Difference]: Without dead ends: 3386 [2022-12-13 21:17:27,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:27,410 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 305 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:27,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 630 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-12-13 21:17:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3248. [2022-12-13 21:17:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2679 states have (on average 1.2695035460992907) internal successors, (3401), 2696 states have internal predecessors, (3401), 343 states have call successors, (343), 210 states have call predecessors, (343), 218 states have return successors, (486), 343 states have call predecessors, (486), 343 states have call successors, (486) [2022-12-13 21:17:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4230 transitions. [2022-12-13 21:17:27,693 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4230 transitions. Word has length 59 [2022-12-13 21:17:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:27,693 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 4230 transitions. [2022-12-13 21:17:27,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4230 transitions. [2022-12-13 21:17:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 21:17:27,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:27,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:17:27,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1752402570, now seen corresponding path program 1 times [2022-12-13 21:17:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:27,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137247311] [2022-12-13 21:17:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:17:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137247311] [2022-12-13 21:17:27,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137247311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:27,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:27,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102586997] [2022-12-13 21:17:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:27,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:27,747 INFO L87 Difference]: Start difference. First operand 3248 states and 4230 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:28,158 INFO L93 Difference]: Finished difference Result 5046 states and 6653 transitions. [2022-12-13 21:17:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-12-13 21:17:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:28,179 INFO L225 Difference]: With dead ends: 5046 [2022-12-13 21:17:28,179 INFO L226 Difference]: Without dead ends: 5044 [2022-12-13 21:17:28,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:28,182 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 322 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:28,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 516 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2022-12-13 21:17:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4823. [2022-12-13 21:17:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3989 states have (on average 1.266984206568062) internal successors, (5054), 4011 states have internal predecessors, (5054), 503 states have call successors, (503), 310 states have call predecessors, (503), 323 states have return successors, (720), 503 states have call predecessors, (720), 503 states have call successors, (720) [2022-12-13 21:17:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6277 transitions. [2022-12-13 21:17:28,550 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6277 transitions. Word has length 60 [2022-12-13 21:17:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:28,550 INFO L495 AbstractCegarLoop]: Abstraction has 4823 states and 6277 transitions. [2022-12-13 21:17:28,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 21:17:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6277 transitions. [2022-12-13 21:17:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 21:17:28,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:28,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:28,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:17:28,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2044119821, now seen corresponding path program 1 times [2022-12-13 21:17:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:28,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320288751] [2022-12-13 21:17:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:17:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:28,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320288751] [2022-12-13 21:17:28,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320288751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:28,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:28,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:17:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185592677] [2022-12-13 21:17:28,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:28,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:28,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:28,616 INFO L87 Difference]: Start difference. First operand 4823 states and 6277 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:17:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:29,296 INFO L93 Difference]: Finished difference Result 13328 states and 17731 transitions. [2022-12-13 21:17:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:17:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2022-12-13 21:17:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:29,334 INFO L225 Difference]: With dead ends: 13328 [2022-12-13 21:17:29,334 INFO L226 Difference]: Without dead ends: 8521 [2022-12-13 21:17:29,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:29,342 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 455 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:29,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 632 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:17:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2022-12-13 21:17:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8239. [2022-12-13 21:17:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8239 states, 6727 states have (on average 1.2430503939348891) internal successors, (8362), 6799 states have internal predecessors, (8362), 893 states have call successors, (893), 550 states have call predecessors, (893), 611 states have return successors, (1678), 893 states have call predecessors, (1678), 893 states have call successors, (1678) [2022-12-13 21:17:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 10933 transitions. [2022-12-13 21:17:29,837 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 10933 transitions. Word has length 70 [2022-12-13 21:17:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:29,838 INFO L495 AbstractCegarLoop]: Abstraction has 8239 states and 10933 transitions. [2022-12-13 21:17:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:17:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 10933 transitions. [2022-12-13 21:17:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 21:17:29,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:29,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:29,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:17:29,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1620972028, now seen corresponding path program 1 times [2022-12-13 21:17:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:29,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974642642] [2022-12-13 21:17:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:17:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 21:17:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:29,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974642642] [2022-12-13 21:17:29,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974642642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:29,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:29,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:17:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419567777] [2022-12-13 21:17:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:29,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:17:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:17:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:29,918 INFO L87 Difference]: Start difference. First operand 8239 states and 10933 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:17:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:30,610 INFO L93 Difference]: Finished difference Result 16593 states and 22002 transitions. [2022-12-13 21:17:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:17:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2022-12-13 21:17:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:30,646 INFO L225 Difference]: With dead ends: 16593 [2022-12-13 21:17:30,646 INFO L226 Difference]: Without dead ends: 7947 [2022-12-13 21:17:30,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:17:30,672 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 678 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:30,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 855 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:17:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-12-13 21:17:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 7719. [2022-12-13 21:17:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7719 states, 6301 states have (on average 1.228059038247897) internal successors, (7738), 6372 states have internal predecessors, (7738), 834 states have call successors, (834), 515 states have call predecessors, (834), 576 states have return successors, (1435), 834 states have call predecessors, (1435), 834 states have call successors, (1435) [2022-12-13 21:17:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 10007 transitions. [2022-12-13 21:17:31,312 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 10007 transitions. Word has length 82 [2022-12-13 21:17:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:31,313 INFO L495 AbstractCegarLoop]: Abstraction has 7719 states and 10007 transitions. [2022-12-13 21:17:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 21:17:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 10007 transitions. [2022-12-13 21:17:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 21:17:31,317 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:31,317 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:31,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:17:31,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 398620961, now seen corresponding path program 1 times [2022-12-13 21:17:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:31,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428889781] [2022-12-13 21:17:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 21:17:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:17:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:17:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 21:17:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:17:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 21:17:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-13 21:17:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428889781] [2022-12-13 21:17:31,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428889781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215998273] [2022-12-13 21:17:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:31,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:17:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:31,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:31,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 21:17:31,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:31,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215998273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:31,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:31,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-12-13 21:17:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424191645] [2022-12-13 21:17:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:31,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:31,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:31,595 INFO L87 Difference]: Start difference. First operand 7719 states and 10007 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:31,866 INFO L93 Difference]: Finished difference Result 12033 states and 15714 transitions. [2022-12-13 21:17:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2022-12-13 21:17:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:31,879 INFO L225 Difference]: With dead ends: 12033 [2022-12-13 21:17:31,880 INFO L226 Difference]: Without dead ends: 5587 [2022-12-13 21:17:31,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:31,892 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:31,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2022-12-13 21:17:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5587. [2022-12-13 21:17:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4555 states have (on average 1.2169045005488475) internal successors, (5543), 4604 states have internal predecessors, (5543), 610 states have call successors, (610), 375 states have call predecessors, (610), 414 states have return successors, (977), 610 states have call predecessors, (977), 610 states have call successors, (977) [2022-12-13 21:17:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7130 transitions. [2022-12-13 21:17:32,181 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7130 transitions. Word has length 127 [2022-12-13 21:17:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:32,181 INFO L495 AbstractCegarLoop]: Abstraction has 5587 states and 7130 transitions. [2022-12-13 21:17:32,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7130 transitions. [2022-12-13 21:17:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-13 21:17:32,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:32,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:32,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:32,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1617965029, now seen corresponding path program 1 times [2022-12-13 21:17:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028446335] [2022-12-13 21:17:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 21:17:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:17:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:17:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 21:17:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 21:17:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028446335] [2022-12-13 21:17:32,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028446335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534121111] [2022-12-13 21:17:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:32,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:32,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:17:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:32,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:32,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 21:17:32,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534121111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-12-13 21:17:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940054779] [2022-12-13 21:17:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:32,755 INFO L87 Difference]: Start difference. First operand 5587 states and 7130 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:33,172 INFO L93 Difference]: Finished difference Result 12745 states and 16166 transitions. [2022-12-13 21:17:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-12-13 21:17:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:33,201 INFO L225 Difference]: With dead ends: 12745 [2022-12-13 21:17:33,202 INFO L226 Difference]: Without dead ends: 8431 [2022-12-13 21:17:33,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:33,216 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 64 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:33,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 290 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2022-12-13 21:17:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8428. [2022-12-13 21:17:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 6846 states have (on average 1.1958808063102542) internal successors, (8187), 6905 states have internal predecessors, (8187), 925 states have call successors, (925), 600 states have call predecessors, (925), 649 states have return successors, (1342), 925 states have call predecessors, (1342), 925 states have call successors, (1342) [2022-12-13 21:17:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 10454 transitions. [2022-12-13 21:17:33,895 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 10454 transitions. Word has length 130 [2022-12-13 21:17:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:33,895 INFO L495 AbstractCegarLoop]: Abstraction has 8428 states and 10454 transitions. [2022-12-13 21:17:33,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 10454 transitions. [2022-12-13 21:17:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 21:17:33,901 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:33,902 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:33,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:34,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:34,102 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1204461291, now seen corresponding path program 1 times [2022-12-13 21:17:34,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:34,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271729056] [2022-12-13 21:17:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:17:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:17:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:17:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 21:17:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 21:17:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 21:17:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 21:17:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271729056] [2022-12-13 21:17:34,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271729056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9253655] [2022-12-13 21:17:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:34,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:34,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:34,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:17:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:34,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:34,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 21:17:34,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9253655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:34,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:34,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-12-13 21:17:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129110489] [2022-12-13 21:17:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:34,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:34,379 INFO L87 Difference]: Start difference. First operand 8428 states and 10454 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:34,671 INFO L93 Difference]: Finished difference Result 13900 states and 17415 transitions. [2022-12-13 21:17:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2022-12-13 21:17:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:34,686 INFO L225 Difference]: With dead ends: 13900 [2022-12-13 21:17:34,687 INFO L226 Difference]: Without dead ends: 6508 [2022-12-13 21:17:34,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:34,698 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:34,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2022-12-13 21:17:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6508. [2022-12-13 21:17:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 5284 states have (on average 1.2036336109008328) internal successors, (6360), 5333 states have internal predecessors, (6360), 722 states have call successors, (722), 455 states have call predecessors, (722), 494 states have return successors, (1101), 722 states have call predecessors, (1101), 722 states have call successors, (1101) [2022-12-13 21:17:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 8183 transitions. [2022-12-13 21:17:35,031 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 8183 transitions. Word has length 141 [2022-12-13 21:17:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:35,031 INFO L495 AbstractCegarLoop]: Abstraction has 6508 states and 8183 transitions. [2022-12-13 21:17:35,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 8183 transitions. [2022-12-13 21:17:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-13 21:17:35,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:35,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:35,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:35,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:17:35,235 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 646813658, now seen corresponding path program 1 times [2022-12-13 21:17:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:35,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000132236] [2022-12-13 21:17:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 21:17:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:17:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 21:17:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 21:17:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 21:17:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 21:17:35,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:35,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000132236] [2022-12-13 21:17:35,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000132236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:35,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074714586] [2022-12-13 21:17:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:35,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:35,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:35,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:35,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:17:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:35,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:35,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 21:17:35,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:35,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074714586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:35,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:35,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 21:17:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110805138] [2022-12-13 21:17:35,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:35,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:35,448 INFO L87 Difference]: Start difference. First operand 6508 states and 8183 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 21:17:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:35,680 INFO L93 Difference]: Finished difference Result 8734 states and 11097 transitions. [2022-12-13 21:17:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2022-12-13 21:17:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:35,691 INFO L225 Difference]: With dead ends: 8734 [2022-12-13 21:17:35,691 INFO L226 Difference]: Without dead ends: 3722 [2022-12-13 21:17:35,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:35,702 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 86 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:35,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 268 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-12-13 21:17:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3719. [2022-12-13 21:17:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3031 states have (on average 1.1956450016496205) internal successors, (3624), 3059 states have internal predecessors, (3624), 406 states have call successors, (406), 255 states have call predecessors, (406), 274 states have return successors, (537), 406 states have call predecessors, (537), 406 states have call successors, (537) [2022-12-13 21:17:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4567 transitions. [2022-12-13 21:17:36,011 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4567 transitions. Word has length 151 [2022-12-13 21:17:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:36,012 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 4567 transitions. [2022-12-13 21:17:36,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 21:17:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4567 transitions. [2022-12-13 21:17:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 21:17:36,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:36,016 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:36,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:17:36,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 21:17:36,217 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -845187855, now seen corresponding path program 1 times [2022-12-13 21:17:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:36,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752907583] [2022-12-13 21:17:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:17:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:17:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:17:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:17:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:17:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 21:17:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 21:17:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-13 21:17:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:36,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752907583] [2022-12-13 21:17:36,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752907583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:36,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369166977] [2022-12-13 21:17:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:36,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:36,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:36,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:17:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:36,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:36,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 21:17:36,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:36,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369166977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:36,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:36,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 21:17:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227433575] [2022-12-13 21:17:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:36,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:36,418 INFO L87 Difference]: Start difference. First operand 3719 states and 4567 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 21:17:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:36,655 INFO L93 Difference]: Finished difference Result 8907 states and 10999 transitions. [2022-12-13 21:17:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 164 [2022-12-13 21:17:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:36,665 INFO L225 Difference]: With dead ends: 8907 [2022-12-13 21:17:36,665 INFO L226 Difference]: Without dead ends: 5738 [2022-12-13 21:17:36,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:36,671 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 105 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:36,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2022-12-13 21:17:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5728. [2022-12-13 21:17:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 4712 states have (on average 1.1808149405772497) internal successors, (5564), 4751 states have internal predecessors, (5564), 581 states have call successors, (581), 397 states have call predecessors, (581), 427 states have return successors, (796), 581 states have call predecessors, (796), 581 states have call successors, (796) [2022-12-13 21:17:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 6941 transitions. [2022-12-13 21:17:37,128 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 6941 transitions. Word has length 164 [2022-12-13 21:17:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:37,129 INFO L495 AbstractCegarLoop]: Abstraction has 5728 states and 6941 transitions. [2022-12-13 21:17:37,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 21:17:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 6941 transitions. [2022-12-13 21:17:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 21:17:37,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:37,133 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:37,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:17:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 21:17:37,333 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash 52205423, now seen corresponding path program 1 times [2022-12-13 21:17:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:37,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771316679] [2022-12-13 21:17:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 21:17:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:17:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 21:17:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:17:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 21:17:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 21:17:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 21:17:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-13 21:17:37,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:37,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771316679] [2022-12-13 21:17:37,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771316679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:37,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021813079] [2022-12-13 21:17:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:37,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:37,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:17:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:37,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:17:37,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 21:17:37,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:37,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021813079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:37,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:37,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-12-13 21:17:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563343386] [2022-12-13 21:17:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:37,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:17:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:37,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:17:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:17:37,594 INFO L87 Difference]: Start difference. First operand 5728 states and 6941 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 21:17:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:37,837 INFO L93 Difference]: Finished difference Result 9257 states and 11268 transitions. [2022-12-13 21:17:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-12-13 21:17:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:37,844 INFO L225 Difference]: With dead ends: 9257 [2022-12-13 21:17:37,844 INFO L226 Difference]: Without dead ends: 3544 [2022-12-13 21:17:37,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:17:37,850 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 59 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:37,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 668 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2022-12-13 21:17:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3364. [2022-12-13 21:17:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2871 states have (on average 1.1894810170672239) internal successors, (3415), 2884 states have internal predecessors, (3415), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-12-13 21:17:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4071 transitions. [2022-12-13 21:17:38,002 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4071 transitions. Word has length 164 [2022-12-13 21:17:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:38,002 INFO L495 AbstractCegarLoop]: Abstraction has 3364 states and 4071 transitions. [2022-12-13 21:17:38,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 21:17:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4071 transitions. [2022-12-13 21:17:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-13 21:17:38,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:38,004 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:38,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:17:38,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 21:17:38,205 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 471572056, now seen corresponding path program 1 times [2022-12-13 21:17:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:38,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879852743] [2022-12-13 21:17:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 21:17:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 21:17:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:17:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:17:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 21:17:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:38,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879852743] [2022-12-13 21:17:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879852743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:38,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460695764] [2022-12-13 21:17:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:38,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:38,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:38,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:38,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:17:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:38,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 21:17:38,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:38,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460695764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:38,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:38,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 21:17:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135919528] [2022-12-13 21:17:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:38,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:38,450 INFO L87 Difference]: Start difference. First operand 3364 states and 4071 transitions. Second operand has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:38,619 INFO L93 Difference]: Finished difference Result 3364 states and 4071 transitions. [2022-12-13 21:17:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:38,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 168 [2022-12-13 21:17:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:38,624 INFO L225 Difference]: With dead ends: 3364 [2022-12-13 21:17:38,624 INFO L226 Difference]: Without dead ends: 3362 [2022-12-13 21:17:38,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:38,625 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:38,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2022-12-13 21:17:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3362. [2022-12-13 21:17:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 2871 states have (on average 1.1818181818181819) internal successors, (3393), 2882 states have internal predecessors, (3393), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-12-13 21:17:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4049 transitions. [2022-12-13 21:17:38,771 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4049 transitions. Word has length 168 [2022-12-13 21:17:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:38,771 INFO L495 AbstractCegarLoop]: Abstraction has 3362 states and 4049 transitions. [2022-12-13 21:17:38,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4049 transitions. [2022-12-13 21:17:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 21:17:38,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:38,772 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:38,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:17:38,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:38,974 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1404056422, now seen corresponding path program 1 times [2022-12-13 21:17:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:38,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541969739] [2022-12-13 21:17:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 21:17:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 21:17:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:17:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 21:17:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 21:17:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541969739] [2022-12-13 21:17:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541969739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689342064] [2022-12-13 21:17:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:39,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:39,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:39,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:17:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:39,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 21:17:39,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:39,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689342064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:39,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:39,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-12-13 21:17:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044360834] [2022-12-13 21:17:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:39,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:39,174 INFO L87 Difference]: Start difference. First operand 3362 states and 4049 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 21:17:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:39,331 INFO L93 Difference]: Finished difference Result 5976 states and 7312 transitions. [2022-12-13 21:17:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 169 [2022-12-13 21:17:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:39,336 INFO L225 Difference]: With dead ends: 5976 [2022-12-13 21:17:39,337 INFO L226 Difference]: Without dead ends: 3283 [2022-12-13 21:17:39,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:39,340 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 90 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:39,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 350 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2022-12-13 21:17:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3282. [2022-12-13 21:17:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2791 states have (on average 1.171981368685059) internal successors, (3271), 2802 states have internal predecessors, (3271), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-12-13 21:17:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 3927 transitions. [2022-12-13 21:17:39,485 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 3927 transitions. Word has length 169 [2022-12-13 21:17:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:39,485 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 3927 transitions. [2022-12-13 21:17:39,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 21:17:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 3927 transitions. [2022-12-13 21:17:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-13 21:17:39,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:39,486 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:39,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:39,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:39,687 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1943202269, now seen corresponding path program 1 times [2022-12-13 21:17:39,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:39,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254641431] [2022-12-13 21:17:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 21:17:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254641431] [2022-12-13 21:17:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254641431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379673982] [2022-12-13 21:17:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:39,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:39,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:39,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:39,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 21:17:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:39,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:39,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:17:40,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:40,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379673982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:40,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:40,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 21:17:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381115486] [2022-12-13 21:17:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:40,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:40,011 INFO L87 Difference]: Start difference. First operand 3282 states and 3927 transitions. Second operand has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:40,292 INFO L93 Difference]: Finished difference Result 3283 states and 3927 transitions. [2022-12-13 21:17:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:17:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 170 [2022-12-13 21:17:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:40,298 INFO L225 Difference]: With dead ends: 3283 [2022-12-13 21:17:40,298 INFO L226 Difference]: Without dead ends: 3281 [2022-12-13 21:17:40,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:40,299 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:40,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 309 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-12-13 21:17:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3280. [2022-12-13 21:17:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2791 states have (on average 1.1648154783231817) internal successors, (3251), 2800 states have internal predecessors, (3251), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2022-12-13 21:17:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 3907 transitions. [2022-12-13 21:17:40,462 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 3907 transitions. Word has length 170 [2022-12-13 21:17:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:40,462 INFO L495 AbstractCegarLoop]: Abstraction has 3280 states and 3907 transitions. [2022-12-13 21:17:40,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3907 transitions. [2022-12-13 21:17:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-13 21:17:40,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:40,464 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:40,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 21:17:40,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 21:17:40,665 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 109728449, now seen corresponding path program 1 times [2022-12-13 21:17:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655852862] [2022-12-13 21:17:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 21:17:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:40,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655852862] [2022-12-13 21:17:40,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655852862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:40,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227300177] [2022-12-13 21:17:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:40,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:40,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:40,789 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:40,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 21:17:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:40,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:40,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 21:17:41,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:17:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 21:17:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227300177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:17:41,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:17:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 21:17:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357995519] [2022-12-13 21:17:41,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:17:41,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:17:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:17:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:41,140 INFO L87 Difference]: Start difference. First operand 3280 states and 3907 transitions. Second operand has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2022-12-13 21:17:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:41,876 INFO L93 Difference]: Finished difference Result 10629 states and 12813 transitions. [2022-12-13 21:17:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:17:41,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 171 [2022-12-13 21:17:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:41,890 INFO L225 Difference]: With dead ends: 10629 [2022-12-13 21:17:41,890 INFO L226 Difference]: Without dead ends: 10621 [2022-12-13 21:17:41,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:17:41,893 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 582 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:41,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 647 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:17:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2022-12-13 21:17:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 8614. [2022-12-13 21:17:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 7397 states have (on average 1.173043125591456) internal successors, (8677), 7420 states have internal predecessors, (8677), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2022-12-13 21:17:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 10425 transitions. [2022-12-13 21:17:42,313 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 10425 transitions. Word has length 171 [2022-12-13 21:17:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:42,314 INFO L495 AbstractCegarLoop]: Abstraction has 8614 states and 10425 transitions. [2022-12-13 21:17:42,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2022-12-13 21:17:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 10425 transitions. [2022-12-13 21:17:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-13 21:17:42,315 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:42,316 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:42,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 21:17:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:42,517 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash 387884551, now seen corresponding path program 1 times [2022-12-13 21:17:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230298891] [2022-12-13 21:17:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 21:17:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230298891] [2022-12-13 21:17:42,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230298891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:42,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:42,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:17:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793686090] [2022-12-13 21:17:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:42,595 INFO L87 Difference]: Start difference. First operand 8614 states and 10425 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 21:17:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:43,062 INFO L93 Difference]: Finished difference Result 8826 states and 10658 transitions. [2022-12-13 21:17:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:17:43,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 180 [2022-12-13 21:17:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:43,075 INFO L225 Difference]: With dead ends: 8826 [2022-12-13 21:17:43,075 INFO L226 Difference]: Without dead ends: 8825 [2022-12-13 21:17:43,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:43,077 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 162 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:43,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 191 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2022-12-13 21:17:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8613. [2022-12-13 21:17:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 7397 states have (on average 1.1692578072191429) internal successors, (8649), 7419 states have internal predecessors, (8649), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2022-12-13 21:17:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 10397 transitions. [2022-12-13 21:17:43,513 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 10397 transitions. Word has length 180 [2022-12-13 21:17:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:43,514 INFO L495 AbstractCegarLoop]: Abstraction has 8613 states and 10397 transitions. [2022-12-13 21:17:43,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 21:17:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 10397 transitions. [2022-12-13 21:17:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-13 21:17:43,522 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:43,522 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:43,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:17:43,523 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash -640957901, now seen corresponding path program 1 times [2022-12-13 21:17:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416743422] [2022-12-13 21:17:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:17:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:17:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:17:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 21:17:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:17:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 21:17:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 21:17:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:17:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 21:17:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 21:17:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-12-13 21:17:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 21:17:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-12-13 21:17:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 21:17:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-12-13 21:17:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:43,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416743422] [2022-12-13 21:17:43,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416743422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:43,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472329695] [2022-12-13 21:17:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:43,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:43,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:43,604 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:43,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 21:17:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:43,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:43,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 21:17:43,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:43,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472329695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:43,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:43,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 21:17:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652796121] [2022-12-13 21:17:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:43,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:43,744 INFO L87 Difference]: Start difference. First operand 8613 states and 10397 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 21:17:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:44,380 INFO L93 Difference]: Finished difference Result 22121 states and 26779 transitions. [2022-12-13 21:17:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 235 [2022-12-13 21:17:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:44,402 INFO L225 Difference]: With dead ends: 22121 [2022-12-13 21:17:44,402 INFO L226 Difference]: Without dead ends: 13878 [2022-12-13 21:17:44,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:44,411 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 65 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:44,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 365 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2022-12-13 21:17:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 13761. [2022-12-13 21:17:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13761 states, 11791 states have (on average 1.1635993554405903) internal successors, (13720), 11813 states have internal predecessors, (13720), 1143 states have call successors, (1143), 715 states have call predecessors, (1143), 824 states have return successors, (1681), 1232 states have call predecessors, (1681), 1143 states have call successors, (1681) [2022-12-13 21:17:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 16544 transitions. [2022-12-13 21:17:45,183 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 16544 transitions. Word has length 235 [2022-12-13 21:17:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:45,183 INFO L495 AbstractCegarLoop]: Abstraction has 13761 states and 16544 transitions. [2022-12-13 21:17:45,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-12-13 21:17:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 16544 transitions. [2022-12-13 21:17:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-13 21:17:45,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:45,189 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:45,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 21:17:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:45,390 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -973601039, now seen corresponding path program 1 times [2022-12-13 21:17:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863495525] [2022-12-13 21:17:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:17:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:17:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:17:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 21:17:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:17:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 21:17:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 21:17:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:17:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 21:17:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 21:17:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-12-13 21:17:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 21:17:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-12-13 21:17:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 21:17:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-12-13 21:17:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863495525] [2022-12-13 21:17:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863495525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359113433] [2022-12-13 21:17:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:45,476 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:45,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 21:17:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:45,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:45,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-13 21:17:45,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:45,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359113433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:45,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:45,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 21:17:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699743195] [2022-12-13 21:17:45,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:45,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:45,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:45,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:45,592 INFO L87 Difference]: Start difference. First operand 13761 states and 16544 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 21:17:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:45,967 INFO L93 Difference]: Finished difference Result 19280 states and 23230 transitions. [2022-12-13 21:17:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:45,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 235 [2022-12-13 21:17:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:45,979 INFO L225 Difference]: With dead ends: 19280 [2022-12-13 21:17:45,979 INFO L226 Difference]: Without dead ends: 5835 [2022-12-13 21:17:45,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:45,991 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:45,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2022-12-13 21:17:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5584. [2022-12-13 21:17:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 4745 states have (on average 1.144994731296101) internal successors, (5433), 4763 states have internal predecessors, (5433), 466 states have call successors, (466), 317 states have call predecessors, (466), 370 states have return successors, (729), 503 states have call predecessors, (729), 466 states have call successors, (729) [2022-12-13 21:17:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 6628 transitions. [2022-12-13 21:17:46,411 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 6628 transitions. Word has length 235 [2022-12-13 21:17:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:46,412 INFO L495 AbstractCegarLoop]: Abstraction has 5584 states and 6628 transitions. [2022-12-13 21:17:46,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 21:17:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 6628 transitions. [2022-12-13 21:17:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-12-13 21:17:46,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:46,415 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:46,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:46,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 21:17:46,617 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1947915389, now seen corresponding path program 1 times [2022-12-13 21:17:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:46,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104355104] [2022-12-13 21:17:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:17:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:17:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:17:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 21:17:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:17:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 21:17:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 21:17:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 21:17:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 21:17:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 21:17:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 21:17:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-12-13 21:17:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-12-13 21:17:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-12-13 21:17:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 21:17:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 40 proven. 54 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2022-12-13 21:17:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:46,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104355104] [2022-12-13 21:17:46,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104355104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:46,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598444027] [2022-12-13 21:17:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:46,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:46,718 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:46,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 21:17:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:46,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:17:46,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 21:17:46,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:17:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-12-13 21:17:47,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598444027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:17:47,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:17:47,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 21:17:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495053940] [2022-12-13 21:17:47,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:17:47,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:17:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:17:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:47,024 INFO L87 Difference]: Start difference. First operand 5584 states and 6628 transitions. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2022-12-13 21:17:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:47,923 INFO L93 Difference]: Finished difference Result 16476 states and 20380 transitions. [2022-12-13 21:17:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 21:17:47,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) Word has length 258 [2022-12-13 21:17:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:47,944 INFO L225 Difference]: With dead ends: 16476 [2022-12-13 21:17:47,945 INFO L226 Difference]: Without dead ends: 11128 [2022-12-13 21:17:47,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 565 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-12-13 21:17:47,952 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 478 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:47,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1252 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:17:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11128 states. [2022-12-13 21:17:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11128 to 7121. [2022-12-13 21:17:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 6025 states have (on average 1.1266390041493777) internal successors, (6788), 6060 states have internal predecessors, (6788), 603 states have call successors, (603), 408 states have call predecessors, (603), 490 states have return successors, (818), 652 states have call predecessors, (818), 603 states have call successors, (818) [2022-12-13 21:17:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 8209 transitions. [2022-12-13 21:17:48,639 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 8209 transitions. Word has length 258 [2022-12-13 21:17:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:48,640 INFO L495 AbstractCegarLoop]: Abstraction has 7121 states and 8209 transitions. [2022-12-13 21:17:48,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2022-12-13 21:17:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 8209 transitions. [2022-12-13 21:17:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-12-13 21:17:48,648 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:48,648 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:48,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 21:17:48,850 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641919, now seen corresponding path program 1 times [2022-12-13 21:17:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:48,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799820111] [2022-12-13 21:17:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 21:17:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:17:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:17:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 21:17:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 21:17:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:17:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 21:17:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-12-13 21:17:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 21:17:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 21:17:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 21:17:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-12-13 21:17:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-12-13 21:17:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-12-13 21:17:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 21:17:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 21:17:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-12-13 21:17:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799820111] [2022-12-13 21:17:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799820111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:48,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:48,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870846658] [2022-12-13 21:17:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:48,916 INFO L87 Difference]: Start difference. First operand 7121 states and 8209 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:49,356 INFO L93 Difference]: Finished difference Result 7424 states and 8547 transitions. [2022-12-13 21:17:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:17:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 260 [2022-12-13 21:17:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:49,367 INFO L225 Difference]: With dead ends: 7424 [2022-12-13 21:17:49,367 INFO L226 Difference]: Without dead ends: 7140 [2022-12-13 21:17:49,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:49,369 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:49,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 205 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2022-12-13 21:17:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 7096. [2022-12-13 21:17:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 6006 states have (on average 1.126873126873127) internal successors, (6768), 6041 states have internal predecessors, (6768), 600 states have call successors, (600), 405 states have call predecessors, (600), 487 states have return successors, (815), 649 states have call predecessors, (815), 600 states have call successors, (815) [2022-12-13 21:17:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 8183 transitions. [2022-12-13 21:17:49,819 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 8183 transitions. Word has length 260 [2022-12-13 21:17:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:49,820 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 8183 transitions. [2022-12-13 21:17:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:17:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 8183 transitions. [2022-12-13 21:17:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-12-13 21:17:49,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:49,824 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:49,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 21:17:49,824 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1989544471, now seen corresponding path program 1 times [2022-12-13 21:17:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:49,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502657596] [2022-12-13 21:17:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:17:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:17:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 21:17:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 21:17:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 21:17:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:17:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 21:17:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 21:17:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-12-13 21:17:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 21:17:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 21:17:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-12-13 21:17:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-12-13 21:17:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-12-13 21:17:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 21:17:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-12-13 21:17:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 21:17:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-12-13 21:17:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:49,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502657596] [2022-12-13 21:17:49,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502657596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:49,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:49,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424099695] [2022-12-13 21:17:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:49,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:49,921 INFO L87 Difference]: Start difference. First operand 7096 states and 8183 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:50,349 INFO L93 Difference]: Finished difference Result 7141 states and 8238 transitions. [2022-12-13 21:17:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:50,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 265 [2022-12-13 21:17:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:50,358 INFO L225 Difference]: With dead ends: 7141 [2022-12-13 21:17:50,358 INFO L226 Difference]: Without dead ends: 6878 [2022-12-13 21:17:50,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:50,360 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 102 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:50,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 293 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2022-12-13 21:17:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6834. [2022-12-13 21:17:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 5782 states have (on average 1.1281563472846765) internal successors, (6523), 5817 states have internal predecessors, (6523), 579 states have call successors, (579), 390 states have call predecessors, (579), 470 states have return successors, (792), 626 states have call predecessors, (792), 579 states have call successors, (792) [2022-12-13 21:17:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 7894 transitions. [2022-12-13 21:17:50,794 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 7894 transitions. Word has length 265 [2022-12-13 21:17:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:50,794 INFO L495 AbstractCegarLoop]: Abstraction has 6834 states and 7894 transitions. [2022-12-13 21:17:50,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-12-13 21:17:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 7894 transitions. [2022-12-13 21:17:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-12-13 21:17:50,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:50,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:50,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 21:17:50,799 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1246222312, now seen corresponding path program 1 times [2022-12-13 21:17:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782267206] [2022-12-13 21:17:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 21:17:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-12-13 21:17:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 21:17:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-12-13 21:17:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 21:17:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 21:17:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-12-13 21:17:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 21:17:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-12-13 21:17:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-12-13 21:17:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:50,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782267206] [2022-12-13 21:17:50,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782267206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:50,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76177891] [2022-12-13 21:17:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:50,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:50,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 21:17:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:50,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 21:17:50,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-12-13 21:17:51,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76177891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:51,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 21:17:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173537484] [2022-12-13 21:17:51,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:51,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:51,056 INFO L87 Difference]: Start difference. First operand 6834 states and 7894 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 21:17:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:51,313 INFO L93 Difference]: Finished difference Result 10944 states and 12661 transitions. [2022-12-13 21:17:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 274 [2022-12-13 21:17:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:51,320 INFO L225 Difference]: With dead ends: 10944 [2022-12-13 21:17:51,320 INFO L226 Difference]: Without dead ends: 4317 [2022-12-13 21:17:51,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:51,326 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 55 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:51,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 344 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2022-12-13 21:17:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4150. [2022-12-13 21:17:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4150 states, 3595 states have (on average 1.1226703755215577) internal successors, (4036), 3597 states have internal predecessors, (4036), 301 states have call successors, (301), 204 states have call predecessors, (301), 251 states have return successors, (381), 348 states have call predecessors, (381), 301 states have call successors, (381) [2022-12-13 21:17:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 4718 transitions. [2022-12-13 21:17:51,578 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 4718 transitions. Word has length 274 [2022-12-13 21:17:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:51,578 INFO L495 AbstractCegarLoop]: Abstraction has 4150 states and 4718 transitions. [2022-12-13 21:17:51,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 21:17:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 4718 transitions. [2022-12-13 21:17:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-12-13 21:17:51,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:51,581 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:51,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 21:17:51,782 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1802388562, now seen corresponding path program 1 times [2022-12-13 21:17:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770219208] [2022-12-13 21:17:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 21:17:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-12-13 21:17:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 21:17:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-12-13 21:17:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-12-13 21:17:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 21:17:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-12-13 21:17:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-12-13 21:17:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-12-13 21:17:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2022-12-13 21:17:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770219208] [2022-12-13 21:17:51,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770219208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991941277] [2022-12-13 21:17:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:51,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:51,895 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:51,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 21:17:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:51,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 21:17:51,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-12-13 21:17:52,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:52,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991941277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:52,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:52,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 21:17:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237045198] [2022-12-13 21:17:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:52,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:52,008 INFO L87 Difference]: Start difference. First operand 4150 states and 4718 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 21:17:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:52,255 INFO L93 Difference]: Finished difference Result 7902 states and 9043 transitions. [2022-12-13 21:17:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 275 [2022-12-13 21:17:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:52,260 INFO L225 Difference]: With dead ends: 7902 [2022-12-13 21:17:52,260 INFO L226 Difference]: Without dead ends: 3853 [2022-12-13 21:17:52,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:17:52,264 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:52,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 535 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2022-12-13 21:17:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2022-12-13 21:17:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3342 states have (on average 1.1187911430281268) internal successors, (3739), 3344 states have internal predecessors, (3739), 290 states have call successors, (290), 204 states have call predecessors, (290), 218 states have return successors, (326), 304 states have call predecessors, (326), 290 states have call successors, (326) [2022-12-13 21:17:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4355 transitions. [2022-12-13 21:17:52,501 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4355 transitions. Word has length 275 [2022-12-13 21:17:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:52,502 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 4355 transitions. [2022-12-13 21:17:52,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 21:17:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4355 transitions. [2022-12-13 21:17:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-12-13 21:17:52,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:52,504 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:52,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:52,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:52,706 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash -186625837, now seen corresponding path program 1 times [2022-12-13 21:17:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:52,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92921845] [2022-12-13 21:17:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 21:17:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:17:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 21:17:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 21:17:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 21:17:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 21:17:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 21:17:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 21:17:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 21:17:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 21:17:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 21:17:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 21:17:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-12-13 21:17:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 21:17:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 21:17:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 21:17:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 21:17:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 21:17:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-12-13 21:17:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92921845] [2022-12-13 21:17:52,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92921845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002349664] [2022-12-13 21:17:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:52,782 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:52,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 21:17:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:52,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:52,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-12-13 21:17:52,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:52,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002349664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:52,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:52,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-12-13 21:17:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152413600] [2022-12-13 21:17:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:52,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:52,904 INFO L87 Difference]: Start difference. First operand 3853 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:17:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:53,160 INFO L93 Difference]: Finished difference Result 4221 states and 4774 transitions. [2022-12-13 21:17:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:53,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 279 [2022-12-13 21:17:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:53,165 INFO L225 Difference]: With dead ends: 4221 [2022-12-13 21:17:53,165 INFO L226 Difference]: Without dead ends: 3854 [2022-12-13 21:17:53,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:53,166 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 47 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:53,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2022-12-13 21:17:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3853. [2022-12-13 21:17:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3342 states have (on average 1.116098144823459) internal successors, (3730), 3344 states have internal predecessors, (3730), 290 states have call successors, (290), 204 states have call predecessors, (290), 218 states have return successors, (326), 304 states have call predecessors, (326), 290 states have call successors, (326) [2022-12-13 21:17:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4346 transitions. [2022-12-13 21:17:53,401 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4346 transitions. Word has length 279 [2022-12-13 21:17:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:53,402 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 4346 transitions. [2022-12-13 21:17:53,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:17:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4346 transitions. [2022-12-13 21:17:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-12-13 21:17:53,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:53,404 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:53,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 21:17:53,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:53,605 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1869725543, now seen corresponding path program 1 times [2022-12-13 21:17:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:53,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465029944] [2022-12-13 21:17:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 21:17:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-12-13 21:17:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 21:17:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 21:17:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 21:17:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 21:17:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 21:17:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 21:17:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 21:17:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-12-13 21:17:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465029944] [2022-12-13 21:17:53,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465029944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:53,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:53,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910929131] [2022-12-13 21:17:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:53,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:53,687 INFO L87 Difference]: Start difference. First operand 3853 states and 4346 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 21:17:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:54,024 INFO L93 Difference]: Finished difference Result 6211 states and 7002 transitions. [2022-12-13 21:17:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 282 [2022-12-13 21:17:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:54,030 INFO L225 Difference]: With dead ends: 6211 [2022-12-13 21:17:54,030 INFO L226 Difference]: Without dead ends: 3727 [2022-12-13 21:17:54,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:54,033 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:54,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 350 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2022-12-13 21:17:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3721. [2022-12-13 21:17:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3218 states have (on average 1.1084524549409571) internal successors, (3567), 3220 states have internal predecessors, (3567), 286 states have call successors, (286), 200 states have call predecessors, (286), 214 states have return successors, (322), 300 states have call predecessors, (322), 286 states have call successors, (322) [2022-12-13 21:17:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4175 transitions. [2022-12-13 21:17:54,270 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4175 transitions. Word has length 282 [2022-12-13 21:17:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:54,271 INFO L495 AbstractCegarLoop]: Abstraction has 3721 states and 4175 transitions. [2022-12-13 21:17:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 21:17:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4175 transitions. [2022-12-13 21:17:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 21:17:54,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:54,273 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:54,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 21:17:54,273 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1724621831, now seen corresponding path program 1 times [2022-12-13 21:17:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:54,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590211046] [2022-12-13 21:17:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:17:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 21:17:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:17:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 21:17:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 21:17:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 21:17:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 21:17:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 21:17:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 21:17:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 21:17:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 21:17:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-12-13 21:17:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 21:17:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 21:17:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-12-13 21:17:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 21:17:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 21:17:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 21:17:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-12-13 21:17:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-12-13 21:17:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590211046] [2022-12-13 21:17:54,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590211046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:54,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:54,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618382289] [2022-12-13 21:17:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:54,358 INFO L87 Difference]: Start difference. First operand 3721 states and 4175 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 21:17:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:54,750 INFO L93 Difference]: Finished difference Result 3721 states and 4175 transitions. [2022-12-13 21:17:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:17:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 283 [2022-12-13 21:17:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:54,755 INFO L225 Difference]: With dead ends: 3721 [2022-12-13 21:17:54,755 INFO L226 Difference]: Without dead ends: 3333 [2022-12-13 21:17:54,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:17:54,756 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 164 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:54,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 488 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2022-12-13 21:17:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2337. [2022-12-13 21:17:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2011 states have (on average 1.1004475385380408) internal successors, (2213), 2012 states have internal predecessors, (2213), 186 states have call successors, (186), 130 states have call predecessors, (186), 138 states have return successors, (210), 194 states have call predecessors, (210), 186 states have call successors, (210) [2022-12-13 21:17:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 2609 transitions. [2022-12-13 21:17:54,923 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 2609 transitions. Word has length 283 [2022-12-13 21:17:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:54,923 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 2609 transitions. [2022-12-13 21:17:54,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 21:17:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2609 transitions. [2022-12-13 21:17:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2022-12-13 21:17:54,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:54,927 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:54,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 21:17:54,928 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2102387823, now seen corresponding path program 1 times [2022-12-13 21:17:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:54,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795509047] [2022-12-13 21:17:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 21:17:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 21:17:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 21:17:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 21:17:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 21:17:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-12-13 21:17:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 21:17:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-12-13 21:17:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-12-13 21:17:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-12-13 21:17:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:54,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 21:17:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-12-13 21:17:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 21:17:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-12-13 21:17:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 21:17:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-12-13 21:17:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-12-13 21:17:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-12-13 21:17:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 21:17:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-12-13 21:17:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 21:17:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 21:17:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-12-13 21:17:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-12-13 21:17:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-12-13 21:17:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-12-13 21:17:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-12-13 21:17:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-12-13 21:17:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-12-13 21:17:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2022-12-13 21:17:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-12-13 21:17:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 150 proven. 94 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2022-12-13 21:17:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:55,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795509047] [2022-12-13 21:17:55,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795509047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858128297] [2022-12-13 21:17:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:55,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:55,023 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:55,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 21:17:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:17:55,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2022-12-13 21:17:55,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:55,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858128297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:55,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:55,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-12-13 21:17:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298232389] [2022-12-13 21:17:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:55,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:17:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:17:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:55,183 INFO L87 Difference]: Start difference. First operand 2337 states and 2609 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:17:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:55,280 INFO L93 Difference]: Finished difference Result 3558 states and 3992 transitions. [2022-12-13 21:17:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:17:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 504 [2022-12-13 21:17:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:55,283 INFO L225 Difference]: With dead ends: 3558 [2022-12-13 21:17:55,283 INFO L226 Difference]: Without dead ends: 1468 [2022-12-13 21:17:55,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:55,285 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:55,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-12-13 21:17:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2022-12-13 21:17:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1278 states have (on average 1.0907668231611893) internal successors, (1394), 1279 states have internal predecessors, (1394), 106 states have call successors, (106), 74 states have call predecessors, (106), 82 states have return successors, (114), 114 states have call predecessors, (114), 106 states have call successors, (114) [2022-12-13 21:17:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1614 transitions. [2022-12-13 21:17:55,378 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1614 transitions. Word has length 504 [2022-12-13 21:17:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:55,379 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 1614 transitions. [2022-12-13 21:17:55,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-12-13 21:17:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1614 transitions. [2022-12-13 21:17:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2022-12-13 21:17:55,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:55,382 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:55,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 21:17:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 21:17:55,584 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 568111464, now seen corresponding path program 1 times [2022-12-13 21:17:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:55,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105788422] [2022-12-13 21:17:55,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 21:17:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-12-13 21:17:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-12-13 21:17:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-12-13 21:17:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-12-13 21:17:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 21:17:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-12-13 21:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-12-13 21:17:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-12-13 21:17:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 21:17:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 21:17:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-12-13 21:17:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-12-13 21:17:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-12-13 21:17:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 21:17:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-12-13 21:17:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-12-13 21:17:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-12-13 21:17:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-12-13 21:17:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-12-13 21:17:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-12-13 21:17:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-12-13 21:17:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-12-13 21:17:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2022-12-13 21:17:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-12-13 21:17:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-12-13 21:17:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2022-12-13 21:17:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2022-12-13 21:17:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 175 proven. 72 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2022-12-13 21:17:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105788422] [2022-12-13 21:17:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105788422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315920800] [2022-12-13 21:17:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:55,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:55,758 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:55,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 21:17:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:55,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 21:17:55,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 661 proven. 0 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2022-12-13 21:17:55,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:55,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315920800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:55,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:55,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-12-13 21:17:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573796795] [2022-12-13 21:17:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:55,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:17:55,897 INFO L87 Difference]: Start difference. First operand 1468 states and 1614 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 21:17:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:55,995 INFO L93 Difference]: Finished difference Result 2678 states and 2958 transitions. [2022-12-13 21:17:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 507 [2022-12-13 21:17:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:55,997 INFO L225 Difference]: With dead ends: 2678 [2022-12-13 21:17:55,997 INFO L226 Difference]: Without dead ends: 1292 [2022-12-13 21:17:55,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:55,999 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 30 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:55,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 514 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-12-13 21:17:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2022-12-13 21:17:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1118 states have (on average 1.0894454382826475) internal successors, (1218), 1119 states have internal predecessors, (1218), 98 states have call successors, (98), 74 states have call predecessors, (98), 74 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2022-12-13 21:17:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1414 transitions. [2022-12-13 21:17:56,082 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1414 transitions. Word has length 507 [2022-12-13 21:17:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:56,082 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1414 transitions. [2022-12-13 21:17:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 21:17:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1414 transitions. [2022-12-13 21:17:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2022-12-13 21:17:56,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:56,085 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:56,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 21:17:56,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 21:17:56,286 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -558889430, now seen corresponding path program 1 times [2022-12-13 21:17:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:56,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193411788] [2022-12-13 21:17:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 21:17:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-12-13 21:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-12-13 21:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-12-13 21:17:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-12-13 21:17:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-12-13 21:17:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 21:17:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-12-13 21:17:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 21:17:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-12-13 21:17:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 21:17:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-12-13 21:17:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-12-13 21:17:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-12-13 21:17:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 21:17:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-12-13 21:17:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-12-13 21:17:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-12-13 21:17:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-12-13 21:17:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-12-13 21:17:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-12-13 21:17:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2022-12-13 21:17:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2022-12-13 21:17:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-12-13 21:17:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2022-12-13 21:17:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-12-13 21:17:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2022-12-13 21:17:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2022-12-13 21:17:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193411788] [2022-12-13 21:17:56,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193411788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:56,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:17:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:17:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663691339] [2022-12-13 21:17:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:56,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:17:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:17:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:17:56,441 INFO L87 Difference]: Start difference. First operand 1292 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 21:17:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:56,661 INFO L93 Difference]: Finished difference Result 2710 states and 2974 transitions. [2022-12-13 21:17:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 519 [2022-12-13 21:17:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:56,663 INFO L225 Difference]: With dead ends: 2710 [2022-12-13 21:17:56,663 INFO L226 Difference]: Without dead ends: 1071 [2022-12-13 21:17:56,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:17:56,665 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:56,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 407 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:17:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-12-13 21:17:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1063. [2022-12-13 21:17:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 916 states have (on average 1.0775109170305677) internal successors, (987), 917 states have internal predecessors, (987), 83 states have call successors, (83), 62 states have call predecessors, (83), 62 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-12-13 21:17:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1153 transitions. [2022-12-13 21:17:56,737 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1153 transitions. Word has length 519 [2022-12-13 21:17:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:56,737 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1153 transitions. [2022-12-13 21:17:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 21:17:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1153 transitions. [2022-12-13 21:17:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-12-13 21:17:56,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:17:56,741 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:17:56,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 21:17:56,741 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 21:17:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:17:56,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1898490450, now seen corresponding path program 1 times [2022-12-13 21:17:56,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:17:56,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679889437] [2022-12-13 21:17:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:17:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 21:17:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:17:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:17:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 21:17:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 21:17:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 21:17:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:17:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 21:17:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 21:17:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 21:17:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 21:17:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 21:17:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 21:17:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 21:17:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-12-13 21:17:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-12-13 21:17:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-12-13 21:17:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-12-13 21:17:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-12-13 21:17:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 21:17:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-12-13 21:17:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-12-13 21:17:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-12-13 21:17:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-12-13 21:17:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-12-13 21:17:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-12-13 21:17:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-12-13 21:17:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-12-13 21:17:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-12-13 21:17:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-12-13 21:17:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-12-13 21:17:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-12-13 21:17:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2022-12-13 21:17:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2022-12-13 21:17:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-12-13 21:17:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-12-13 21:17:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-12-13 21:17:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-12-13 21:17:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2022-12-13 21:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2022-12-13 21:17:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2022-12-13 21:17:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1797 trivial. 0 not checked. [2022-12-13 21:17:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:17:56,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679889437] [2022-12-13 21:17:56,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679889437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:17:56,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75888971] [2022-12-13 21:17:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:17:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:17:56,902 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:17:56,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 21:17:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:17:57,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:17:57,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:17:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-12-13 21:17:57,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:17:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75888971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:17:57,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:17:57,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2022-12-13 21:17:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417412693] [2022-12-13 21:17:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:17:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:17:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:17:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:17:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:57,668 INFO L87 Difference]: Start difference. First operand 1063 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-12-13 21:17:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:17:57,772 INFO L93 Difference]: Finished difference Result 1067 states and 1157 transitions. [2022-12-13 21:17:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:17:57,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 531 [2022-12-13 21:17:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:17:57,773 INFO L225 Difference]: With dead ends: 1067 [2022-12-13 21:17:57,773 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 21:17:57,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:17:57,774 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 34 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:17:57,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 460 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:17:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 21:17:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 21:17:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:17:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 21:17:57,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2022-12-13 21:17:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:17:57,775 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 21:17:57,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-12-13 21:17:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 21:17:57,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 21:17:57,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 21:17:57,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 21:17:57,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 21:17:57,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:17:57,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-12-13 21:18:33,834 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-12-13 21:18:33,836 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse35 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse36 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse37 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse38 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse39 (= ~P_1_pc~0 0))) (let ((.cse16 (and .cse35 .cse36 .cse37 .cse38 .cse39)) (.cse10 (not (<= ~i~0 1))) (.cse2 (not (<= ~num~0 1))) (.cse13 (not (<= ~max_loop~0 2))) (.cse29 (and .cse37 .cse38 (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse21 (not (= ~P_1_ev~0 1))) (.cse22 (and .cse37 .cse38)) (.cse23 (not (= ~C_1_pc~0 1))) (.cse24 (not (= ~C_1_ev~0 1))) (.cse25 (not (<= 1 ~P_1_pc~0))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse28 (not (<= ~num~0 2147483647))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse34 (not .cse26)) (.cse7 (not (<= 0 ~num~0))) (.cse14 (not (= ~P_1_pc~0 1))) (.cse17 (not (<= ~C_1_pc~0 1))) (.cse3 (not (= ~C_1_i~0 1))) (.cse32 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse8 (not (<= ~e~0 0))) (.cse18 (not .cse39)) (.cse11 (not (<= ~P_1_ev~0 0))) (.cse15 (and .cse35 .cse36 .cse37 .cse38)) (.cse19 (not (= ~num~0 0))) (.cse12 (not (<= ~C_1_ev~0 0))) (.cse33 (not (= ~i~0 0))) (.cse30 (<= ~P_1_pc~0 1)) (.cse31 (and .cse35 .cse36 (< 1 ~P_1_pc~0) .cse37 .cse38)) (.cse20 (not (= ~C_1_pc~0 0))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse9 (= |old(~C_1_st~0)| 0)) (.cse27 (not (<= 1 ~num~0)))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse11 .cse9 .cse12)) .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse6 .cse8 .cse18 .cse9 .cse19) (or .cse16 .cse20 .cse6 .cse18 .cse9 .cse19) (or .cse1 .cse21 .cse3 .cse22 .cse23 .cse6 .cse24 .cse8 .cse9 .cse19 .cse25) (or .cse3 (and (or .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse25) (or .cse1 .cse2 .cse6 .cse10 .cse8 .cse11 .cse9 .cse12 .cse25)) .cse23 .cse26 .cse15 .cse27) (or .cse0 .cse1 .cse3 .cse28 .cse5 .cse23 .cse6 .cse26 .cse8 .cse9 .cse15 .cse27 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse23 .cse6 .cse8 .cse9 .cse15 .cse19 .cse25) (or .cse1 .cse2 .cse21 .cse3 .cse4 .cse13 .cse6 .cse24 .cse29 .cse7 .cse14 .cse8 .cse9) (or .cse30 .cse31 .cse20 .cse6 .cse9 .cse19) (or .cse6 .cse32 .cse8 .cse18 .cse15 .cse19 .cse33) (or .cse1 .cse21 .cse3 .cse28 .cse4 .cse34 .cse6 .cse24 .cse29 .cse7 .cse14 .cse8 .cse9) (or .cse1 .cse21 .cse3 .cse22 .cse28 .cse23 .cse6 .cse24 .cse26 .cse8 .cse9 .cse27 .cse25) (or .cse30 .cse31 .cse17 .cse6 .cse8 .cse9 .cse19) (or .cse0 .cse1 .cse3 .cse28 .cse4 .cse5 .cse34 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15) (or .cse30 .cse31 .cse17 .cse6 .cse8 .cse9 .cse27) (or .cse3 .cse32 .cse8 (not (= ~max_loop~0 2)) .cse18 .cse11 .cse15 .cse19 .cse12 (not .cse9) .cse33) (or .cse30 .cse31 .cse20 .cse6 .cse9 .cse27)))) [2022-12-13 21:18:33,837 INFO L895 garLoopResultBuilder]: At program point is_C_1_triggered_returnLabel#1(lines 195 223) the Hoare annotation is: (let ((.cse34 (<= ~max_loop~0 ~i~0)) (.cse43 (<= 1 ~P_1_pc~0)) (.cse46 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse37 (<= |activate_threads_is_C_1_triggered_#res#1| 0)) (.cse47 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse48 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse49 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse50 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse38 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse40 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse51 (<= |activate_threads_~tmp~1#1| 0)) (.cse45 (= ~P_1_pc~0 0)) (.cse41 (<= 0 |activate_threads_is_C_1_triggered_#res#1|)) (.cse42 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse44 (= ~P_1_st~0 0)) (.cse39 (= ~C_1_st~0 |old(~C_1_st~0)|))) (let ((.cse9 (and (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|) (<= 1 |activate_threads_is_C_1_triggered_#res#1|) .cse44 .cse39 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|) (<= 1 |activate_threads_~tmp~1#1|))) (.cse22 (not (<= ~C_1_pc~0 1))) (.cse30 (and .cse46 .cse37 .cse47 .cse48 .cse49 .cse50 .cse38 .cse39 .cse40 .cse51 .cse45 .cse41 .cse42)) (.cse24 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse25 (and .cse46 .cse37 .cse47 .cse48 .cse49 .cse50 .cse38 .cse39 .cse40 .cse51 .cse41 .cse42)) (.cse26 (not .cse45)) (.cse16 (not (= ~num~0 0))) (.cse27 (not (= ~i~0 0))) (.cse1 (not (<= ~num~0 1))) (.cse31 (not (<= ~i~0 1))) (.cse32 (not (<= ~P_1_ev~0 0))) (.cse33 (not (<= ~C_1_ev~0 0))) (.cse5 (not (<= ~max_loop~0 2))) (.cse23 (and .cse37 .cse38 .cse44 .cse39 .cse43 .cse41 .cse42)) (.cse2 (not (= ~P_1_ev~0 1))) (.cse18 (and .cse37 .cse38 .cse39 .cse40 .cse43 .cse41 .cse42)) (.cse20 (not (= ~C_1_pc~0 1))) (.cse7 (not (= ~C_1_ev~0 1))) (.cse21 (not .cse43)) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (= ~C_1_pc~0 0))) (.cse15 (and .cse37 .cse38 (< 1 ~P_1_pc~0) .cse39 .cse40 .cse41 .cse42)) (.cse35 (not (<= 1 ~num~0))) (.cse17 (not (<= 2 ~C_1_ev~0))) (.cse36 (and .cse37 .cse38 .cse39 (<= 2 ~C_1_pc~0) .cse40 .cse41 .cse42)) (.cse0 (not (<= 1 ~i~0))) (.cse3 (not (= ~C_1_i~0 1))) (.cse28 (not (<= ~num~0 2147483647))) (.cse4 (not (= 2 ~C_1_pc~0))) (.cse19 (not (<= 2 ~P_1_ev~0))) (.cse29 (not .cse34)) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse8 (not (<= 0 ~num~0))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse12 (= |old(~C_1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse6 .cse15 .cse12 .cse16) (or .cse17 .cse0 .cse3 .cse18 .cse19 .cse20 .cse6 .cse11 .cse12 .cse16 .cse21) (or .cse13 .cse22 .cse6 .cse15 .cse11 .cse12 .cse16) (or .cse23 .cse0 .cse2 .cse3 .cse18 .cse20 .cse6 .cse7 .cse11 .cse12 .cse16 .cse21) (or .cse6 .cse24 .cse25 .cse11 .cse26 .cse16 .cse27) (or .cse0 .cse2 .cse3 .cse28 .cse4 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse6 .cse26 .cse12 .cse16 .cse30) (or .cse3 .cse18 (and (or .cse0 .cse1 .cse19 .cse6 .cse11 .cse12 .cse21) (or .cse0 .cse1 .cse6 .cse31 .cse11 .cse32 .cse12 .cse33 .cse21)) .cse20 .cse34 .cse35) (or .cse13 .cse22 .cse6 .cse15 .cse11 .cse12 .cse35) (or .cse22 .cse6 .cse11 .cse26 .cse12 .cse16 .cse30) (or .cse3 .cse24 .cse25 .cse11 (not (= ~max_loop~0 2)) .cse26 .cse32 .cse16 .cse33 (not .cse12) .cse27) (or .cse36 (and (or .cse17 .cse0 .cse1 .cse3 .cse4 .cse19 .cse6 .cse8 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse31 .cse11 .cse32 .cse12 .cse33)) .cse5 .cse10) (or .cse17 .cse0 .cse3 .cse18 .cse28 .cse19 .cse20 .cse6 .cse34 .cse11 .cse12 .cse35 .cse21) (or .cse23 .cse0 .cse2 .cse3 .cse18 .cse28 .cse20 .cse6 .cse7 .cse34 .cse11 .cse12 .cse35 .cse21) (or .cse13 .cse14 .cse6 .cse15 .cse12 .cse35) (or .cse17 .cse36 .cse0 .cse3 .cse28 .cse4 .cse19 .cse29 .cse6 .cse8 .cse10 .cse11 .cse12)))) [2022-12-13 21:18:33,838 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 374 399) the Hoare annotation is: (let ((.cse8 (<= ~max_loop~0 ~i~0)) (.cse33 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse34 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse35 (= ~P_1_pc~0 0))) (let ((.cse23 (not (<= ~max_loop~0 2))) (.cse20 (and .cse33 .cse34 .cse35)) (.cse21 (not (<= ~num~0 1))) (.cse26 (not (<= ~i~0 1))) (.cse27 (not (<= ~P_1_ev~0 0))) (.cse28 (not (<= ~C_1_ev~0 0))) (.cse29 (not (= ~C_1_pc~0 0))) (.cse17 (not (= ~P_1_ev~0 1))) (.cse6 (not (= ~C_1_pc~0 1))) (.cse18 (not (= ~C_1_ev~0 1))) (.cse12 (not (<= 1 ~P_1_pc~0))) (.cse31 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse19 (not .cse35)) (.cse15 (not (= ~num~0 0))) (.cse32 (not (= ~i~0 0))) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse2 (not (= ~C_1_i~0 1))) (.cse3 (and .cse33 .cse34)) (.cse4 (not (<= ~num~0 2147483647))) (.cse22 (not (= 2 ~C_1_pc~0))) (.cse5 (not (<= 2 ~P_1_ev~0))) (.cse30 (not .cse8)) (.cse24 (not (<= 0 ~num~0))) (.cse25 (not (= ~P_1_pc~0 1))) (.cse13 (<= ~P_1_pc~0 1)) (.cse14 (not (<= ~C_1_pc~0 1))) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse9 (not (<= ~e~0 0))) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse11 (not (<= 1 ~num~0))) (.cse16 (and (< 1 ~P_1_pc~0) .cse33 .cse34))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse6 .cse7 .cse18 .cse9 .cse10 .cse15 .cse12) (or .cse14 .cse7 .cse9 .cse19 .cse10 .cse15 .cse20) (or .cse1 .cse21 .cse17 .cse2 .cse3 .cse22 .cse23 .cse7 .cse18 .cse24 .cse25 .cse9 .cse10) (or .cse3 (and (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse5 .cse7 .cse24 .cse9 .cse10) (or .cse1 .cse21 .cse2 .cse22 .cse7 .cse24 .cse26 .cse9 .cse27 .cse10 .cse28)) .cse23 .cse25) (or .cse29 .cse7 .cse19 .cse10 .cse15 .cse20) (or .cse1 .cse17 .cse2 .cse3 .cse4 .cse22 .cse30 .cse7 .cse18 .cse24 .cse25 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse12) (or .cse2 .cse3 (and (or .cse1 .cse21 .cse5 .cse7 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse7 .cse26 .cse9 .cse27 .cse10 .cse28 .cse12)) .cse6 .cse8 .cse11) (or .cse13 .cse29 .cse7 .cse10 .cse11 .cse16) (or .cse2 .cse3 .cse31 .cse9 (not (= ~max_loop~0 2)) .cse19 .cse27 .cse15 .cse28 (not .cse10) .cse32) (or .cse13 .cse29 .cse7 .cse10 .cse15 .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse3 .cse7 .cse31 .cse9 .cse19 .cse15 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse30 .cse7 .cse24 .cse25 .cse9 .cse10) (or .cse13 .cse14 .cse7 .cse9 .cse10 .cse11 .cse16)))) [2022-12-13 21:18:33,838 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-12-13 21:18:33,838 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L895 garLoopResultBuilder]: At program point is_P_1_triggered_returnLabel#1(lines 113 131) the Hoare annotation is: (let ((.cse41 (= ~P_1_pc~0 0)) (.cse7 (<= ~max_loop~0 ~i~0)) (.cse35 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse36 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse37 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse38 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse39 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse40 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse21 (not (<= ~max_loop~0 2))) (.cse13 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse16 (not (= ~i~0 0))) (.cse19 (and .cse39 .cse40 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|))) (.cse18 (not (= ~P_1_ev~0 1))) (.cse28 (and .cse39 .cse40)) (.cse22 (not (= ~C_1_ev~0 1))) (.cse29 (<= ~P_1_pc~0 1)) (.cse32 (not (<= ~C_1_pc~0 1))) (.cse31 (and .cse35 .cse36 .cse37 .cse38 (< 1 ~P_1_pc~0) .cse39 .cse40)) (.cse0 (not (<= 2 ~C_1_ev~0))) (.cse3 (not (<= ~num~0 2147483647))) (.cse20 (not (= 2 ~C_1_pc~0))) (.cse34 (not .cse7)) (.cse23 (not (<= 0 ~num~0))) (.cse24 (not (= ~P_1_pc~0 1))) (.cse30 (not (= ~C_1_pc~0 0))) (.cse33 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse14 (not .cse41)) (.cse15 (not (= ~num~0 0))) (.cse2 (not (= ~C_1_i~0 1))) (.cse4 (not (<= 2 ~P_1_ev~0))) (.cse1 (not (<= 1 ~i~0))) (.cse17 (not (<= ~num~0 1))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse25 (not (<= ~i~0 1))) (.cse8 (not (<= ~e~0 0))) (.cse26 (not (<= ~P_1_ev~0 0))) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse27 (not (<= ~C_1_ev~0 0))) (.cse12 (not (<= 1 ~P_1_pc~0))) (.cse5 (not (= ~C_1_pc~0 1))) (.cse9 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)) (.cse11 (not (<= 1 ~num~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse18 .cse2 .cse19 .cse20 .cse21 .cse6 .cse22 .cse23 .cse24 .cse8 .cse10) (or (and (or .cse0 .cse1 .cse17 .cse2 .cse20 .cse4 .cse6 .cse23 .cse8 .cse10) (or .cse1 .cse17 .cse2 .cse20 .cse6 .cse23 .cse25 .cse8 .cse26 .cse10 .cse27)) .cse21 .cse24 .cse9) (or .cse1 .cse18 .cse2 .cse28 .cse5 .cse6 .cse22 .cse8 .cse10 .cse15 .cse12) (or .cse29 .cse30 .cse6 .cse31 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse12) (or .cse2 .cse13 .cse8 (not (= ~max_loop~0 2)) .cse9 .cse14 .cse26 .cse15 .cse27 (not .cse10) .cse16) (or .cse32 .cse33 .cse6 .cse8 .cse14 .cse10 .cse15) (or .cse29 .cse32 .cse6 .cse31 .cse8 .cse10 .cse15) (or .cse29 .cse30 .cse6 .cse31 .cse10 .cse15) (or .cse1 .cse18 .cse2 .cse19 .cse3 .cse20 .cse34 .cse6 .cse22 .cse23 .cse24 .cse8 .cse10) (or .cse1 .cse18 .cse2 .cse28 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse29 .cse32 .cse6 .cse31 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse34 .cse6 .cse23 .cse24 .cse8 .cse9 .cse10) (or .cse30 .cse33 .cse6 .cse14 .cse10 .cse15) (or .cse2 (and (or .cse1 .cse17 .cse4 .cse6 .cse8 .cse10 .cse12) (or .cse1 .cse17 .cse6 .cse25 .cse8 .cse26 .cse10 .cse27 .cse12)) .cse5 .cse7 .cse9 .cse11)))) [2022-12-13 21:18:33,839 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse42 (= ~P_1_pc~0 0)) (.cse40 (<= 1 ~P_1_pc~0)) (.cse43 (<= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse44 (<= 0 |activate_threads_is_P_1_triggered_~__retres1~0#1|)) (.cse45 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse46 (<= 0 |activate_threads_is_P_1_triggered_#res#1|)) (.cse47 (<= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse48 (<= |activate_threads_~tmp~1#1| 0)) (.cse37 (<= 0 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse39 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse41 (<= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse49 (= ~P_1_st~0 0)) (.cse38 (= ~C_1_st~0 |old(~C_1_st~0)|))) (let ((.cse14 (not (<= ~max_loop~0 2))) (.cse33 (and (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|) .cse49 .cse38 (<= 1 |activate_threads_is_P_1_triggered_#res#1|) (<= 1 |activate_threads_is_P_1_triggered_~__retres1~0#1|) (<= 1 |activate_threads_~tmp~1#1|))) (.cse3 (not (<= ~num~0 1))) (.cse11 (not (<= ~i~0 1))) (.cse12 (not (<= ~P_1_ev~0 0))) (.cse13 (not (<= ~C_1_ev~0 0))) (.cse22 (<= ~P_1_pc~0 1)) (.cse23 (and .cse37 (< 1 ~P_1_pc~0) .cse38 .cse39 .cse41)) (.cse34 (not (<= ~C_1_pc~0 1))) (.cse25 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse26 (and .cse43 .cse44 .cse45 .cse46 .cse47 .cse37 .cse38 .cse39 .cse48 .cse41)) (.cse29 (not (= ~i~0 0))) (.cse16 (and .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse30 (not (= ~P_1_ev~0 1))) (.cse18 (not (= ~C_1_pc~0 1))) (.cse32 (not (= ~C_1_ev~0 1))) (.cse36 (and .cse37 .cse49 .cse38 .cse40 .cse41)) (.cse20 (not (<= 1 ~num~0))) (.cse21 (not .cse40)) (.cse24 (not (= ~C_1_pc~0 0))) (.cse35 (and .cse43 .cse44 .cse45 .cse46 .cse47 .cse37 .cse38 .cse39 .cse48 .cse42 .cse41)) (.cse27 (not .cse42)) (.cse28 (not (= ~num~0 0))) (.cse1 (not (<= 2 ~C_1_ev~0))) (.cse2 (not (<= 1 ~i~0))) (.cse4 (not (= ~C_1_i~0 1))) (.cse0 (and .cse37 .cse38 (<= 2 ~C_1_pc~0) .cse39 .cse40 .cse41)) (.cse17 (not (<= ~num~0 2147483647))) (.cse5 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 2 ~P_1_ev~0))) (.cse31 (not .cse19)) (.cse7 (= |old(~P_1_st~0)| 0)) (.cse8 (not (<= 0 ~num~0))) (.cse15 (not (= ~P_1_pc~0 1))) (.cse9 (not (<= ~e~0 0))) (.cse10 (= |old(~C_1_st~0)| 0))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse12 .cse10 .cse13)) .cse14 .cse15) (or .cse16 .cse1 .cse2 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse20 .cse21) (or .cse22 .cse23 .cse24 .cse7 .cse10 .cse20) (or .cse4 .cse25 .cse26 .cse9 (not (= ~max_loop~0 2)) .cse27 .cse12 .cse28 .cse13 (not .cse10) .cse29) (or .cse2 .cse30 .cse4 .cse17 .cse5 .cse31 .cse7 .cse32 .cse8 .cse15 .cse9 .cse33 .cse10) (or .cse2 .cse3 .cse30 .cse4 .cse5 .cse14 .cse7 .cse32 .cse8 .cse15 .cse9 .cse33 .cse10) (or .cse34 .cse35 .cse7 .cse9 .cse27 .cse10 .cse28) (or .cse22 .cse23 .cse24 .cse7 .cse10 .cse28) (or .cse16 .cse2 .cse30 .cse4 .cse18 .cse7 .cse32 .cse36 .cse9 .cse10 .cse28 .cse21) (or .cse22 .cse23 .cse34 .cse7 .cse9 .cse10 .cse20) (or .cse16 .cse4 (and (or .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 .cse21) (or .cse2 .cse3 .cse7 .cse11 .cse9 .cse12 .cse10 .cse13 .cse21)) .cse18 .cse19 .cse20) (or .cse16 .cse1 .cse2 .cse4 .cse6 .cse18 .cse7 .cse9 .cse10 .cse28 .cse21) (or .cse22 .cse23 .cse34 .cse7 .cse9 .cse10 .cse28) (or .cse7 .cse25 .cse26 .cse9 .cse27 .cse28 .cse29) (or .cse16 .cse2 .cse30 .cse4 .cse17 .cse18 .cse7 .cse32 .cse19 .cse36 .cse9 .cse10 .cse20 .cse21) (or .cse24 .cse35 .cse7 .cse27 .cse10 .cse28) (or .cse1 .cse2 .cse4 .cse0 .cse17 .cse5 .cse6 .cse31 .cse7 .cse8 .cse15 .cse9 .cse10)))) [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-12-13 21:18:33,839 INFO L895 garLoopResultBuilder]: At program point L267(lines 251 269) the Hoare annotation is: (let ((.cse23 (= ~C_1_st~0 0)) (.cse26 (<= ~max_loop~0 ~i~0)) (.cse12 (= ~P_1_st~0 0))) (let ((.cse3 (not (= ~max_loop~0 2))) (.cse10 (not (= ~i~0 0))) (.cse11 (not (<= ~num~0 1))) (.cse19 (not (<= ~max_loop~0 2))) (.cse14 (not (<= 1 ~num~0))) (.cse25 (not (<= 1 ~P_1_pc~0))) (.cse24 (not (= ~C_1_pc~0 1))) (.cse4 (not (= ~P_1_pc~0 0))) (.cse5 (not (<= ~P_1_ev~0 0))) (.cse7 (not (= ~num~0 0))) (.cse8 (not (<= ~C_1_ev~0 0))) (.cse9 (not .cse12)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse15 (not (<= 2 ~C_1_ev~0))) (.cse16 (not (<= 1 ~i~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse21 (not (<= ~num~0 2147483647))) (.cse17 (not (= 2 ~C_1_pc~0))) (.cse18 (not (<= 2 ~P_1_ev~0))) (.cse22 (not .cse26)) (.cse20 (not (<= 0 ~num~0))) (.cse13 (not (= ~P_1_pc~0 1))) (.cse2 (not (<= ~e~0 0))) (.cse6 (not .cse23))) (and (or .cse0 .cse1 (not (= ~C_1_pc~0 ~P_1_pc~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 (not (= ~C_1_pc~0 0)) .cse12 .cse13 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8 .cse10) (or .cse0 .cse15 .cse16 .cse11 .cse1 .cse17 .cse18 .cse19 .cse20 .cse13 .cse2 .cse6 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse21 .cse17 .cse18 .cse22 .cse20 .cse13 .cse2 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse18 .cse24 .cse2 .cse7 .cse25 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse21 .cse17 .cse18 .cse12 .cse19 .cse13 .cse2 .cse6 .cse14) (or .cse0 .cse15 .cse16 .cse1 .cse23 .cse21 .cse18 .cse24 .cse26 .cse2 .cse14 .cse25 .cse9) (or .cse0 .cse16 .cse1 .cse23 .cse24 (not (<= ~i~0 1)) .cse2 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse0 .cse15 .cse16 .cse1 .cse21 .cse17 .cse18 .cse22 .cse20 .cse13 .cse2 .cse6)))) [2022-12-13 21:18:33,839 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 250 269) the Hoare annotation is: true [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 269) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 430 488) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-12-13 21:18:33,840 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L895 garLoopResultBuilder]: At program point fire_time_events_returnLabel#1(lines 342 355) the Hoare annotation is: (let ((.cse20 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse20)) (.cse19 (<= ~num~0 2147483647)) (.cse9 (= ~C_1_pc~0 1)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse5 (< 1 ~P_1_pc~0)) (.cse15 (<= 1 ~num~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (<= 1 ~i~0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse10 (= ~P_1_ev~0 1)) (.cse13 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse21 (<= 0 ~num~0)) (.cse14 (= ~C_1_ev~0 1)) (.cse16 (= ~C_1_i~0 1)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 .cse20 .cse3 .cse21 .cse14 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse19 .cse12 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse12 .cse2 .cse3 .cse14 .cse16 .cse4) (and .cse5 .cse1 .cse3 .cse15 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 (<= ~max_loop~0 2) .cse13 .cse3 .cse21 .cse14 .cse16 .cse4)))) [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L895 garLoopResultBuilder]: At program point P_1_returnLabel#1(lines 78 112) the Hoare annotation is: (let ((.cse14 (= ~C_1_st~0 0)) (.cse24 (<= ~max_loop~0 ~i~0))) (let ((.cse21 (<= ~C_1_pc~0 1)) (.cse3 (= ~C_1_pc~0 1)) (.cse25 (not .cse24)) (.cse17 (<= ~P_1_ev~0 0)) (.cse18 (<= ~C_1_ev~0 0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse19 (<= ~num~0 1)) (.cse0 (<= 1 ~i~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse22 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse23 (<= ~num~0 2147483647)) (.cse9 (= ~C_1_i~0 1)) (.cse13 (< 1 ~P_1_pc~0)) (.cse8 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~i~0 0)) (.cse4 (<= ~e~0 0)) (.cse11 (= ~P_1_pc~0 0)) (.cse12 (= ~C_1_pc~0 0)) (.cse7 (= ~num~0 0)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse8 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse10) (and .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 (= ~max_loop~0 2) .cse18 .cse12 .cse19 .cse20 .cse9 .cse10) (and .cse21 .cse4 .cse13 .cse7 .cse8 .cse10) (and .cse21 .cse4 .cse11 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse22 .cse15 .cse4 .cse5 .cse23 .cse24 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse23 .cse6 .cse8 .cse20 .cse9 .cse10) (and .cse21 .cse4 .cse13 .cse8 .cse20 .cse10) (and .cse3 .cse25 (or (and .cse0 .cse4 .cse5 .cse17 (<= ~i~0 1) .cse18 .cse6 .cse19 .cse8 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10)) .cse20 .cse9) (and .cse0 .cse1 .cse2 .cse22 .cse14 .cse15 .cse4 .cse5 (<= ~max_loop~0 2) .cse23 .cse20 .cse9 .cse10) (and .cse13 .cse12 .cse8 .cse20 .cse10) (and .cse16 .cse4 .cse11 .cse12 .cse7 .cse10)))) [2022-12-13 21:18:33,841 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse20 (<= ~max_loop~0 ~i~0))) (let ((.cse6 (<= ~C_1_pc~0 1)) (.cse11 (not .cse20)) (.cse19 (<= ~num~0 2147483647)) (.cse9 (= ~C_1_pc~0 1)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse5 (< 1 ~P_1_pc~0)) (.cse15 (<= 1 ~num~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (<= 1 ~i~0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse10 (= ~P_1_ev~0 1)) (.cse13 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse21 (<= 0 ~num~0)) (.cse14 (= ~C_1_ev~0 1)) (.cse16 (= ~C_1_i~0 1)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 .cse19 .cse20 .cse3 .cse21 .cse14 .cse16 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse15 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse19 .cse12 .cse3 .cse14 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse7 .cse10 .cse12 .cse2 .cse3 .cse14 .cse16 .cse4) (and .cse5 .cse1 .cse3 .cse15 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse17 .cse18 .cse7 .cse10 (<= ~max_loop~0 2) .cse13 .cse3 .cse21 .cse14 .cse16 .cse4)))) [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2022-12-13 21:18:33,841 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse29 (= ~P_1_st~0 0)) (.cse17 (= ~C_1_st~0 0))) (let ((.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (= ~max_loop~0 2)) (.cse27 (<= 0 ~num~0)) (.cse23 (<= ~C_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse24 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse30 (<= ~max_loop~0 2)) (.cse25 (<= ~num~0 2147483647)) (.cse16 (< 1 ~P_1_pc~0)) (.cse19 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse6 (= ~C_1_pc~0 1)) (.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse15 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not .cse17)) (.cse4 (not .cse29)) (.cse28 (not .cse26)) (.cse22 (<= 1 ~num~0)) (.cse12 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse3 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse2 .cse3 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse8 .cse9 .cse20 .cse11 .cse1 .cse21 .cse22 .cse12 .cse4) (and .cse23 .cse7 .cse16 .cse2 .cse3 .cse4) (and .cse17 .cse19 .cse7 .cse9 .cse20 .cse11 .cse0 .cse1 .cse2 .cse12) (and .cse23 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse18 .cse7 .cse25 .cse26 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 .cse15 .cse21 .cse3 .cse22 .cse12) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse29 .cse30 .cse21 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse25 .cse15 .cse3 .cse22 .cse12) (and .cse18 .cse30 (or (and .cse5 .cse13 .cse14 .cse24 .cse7 .cse21 .cse3 .cse27 .cse12 .cse4) (and .cse5 .cse24 .cse7 .cse9 .cse10 .cse11 .cse21 .cse3 .cse27 .cse12 .cse4))) (and .cse23 .cse7 .cse16 .cse3 .cse22 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse30 .cse25 .cse22 .cse12 .cse4) (and .cse16 .cse1 .cse3 .cse22 .cse4) (and .cse19 .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse6 (or (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse15 .cse21 .cse3 .cse4) (and .cse5 .cse14 .cse7 .cse15 .cse21 .cse3 .cse4)) .cse28 .cse22 .cse12)))) [2022-12-13 21:18:33,842 INFO L895 garLoopResultBuilder]: At program point C_1_returnLabel#1(lines 137 194) the Hoare annotation is: (let ((.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse20 (<= ~C_1_pc~0 1)) (.cse0 (= ~P_1_pc~0 0)) (.cse17 (= 2 ~C_1_pc~0)) (.cse14 (= ~P_1_pc~0 1)) (.cse19 (<= 0 ~num~0)) (.cse13 (< 1 ~P_1_pc~0)) (.cse1 (= ~C_1_pc~0 0)) (.cse4 (not (= ~P_1_st~0 0))) (.cse5 (<= 1 ~i~0)) (.cse15 (<= 2 ~C_1_ev~0)) (.cse16 (<= 2 ~P_1_ev~0)) (.cse6 (= ~C_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse2 (= ~num~0 0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse12 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse3 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4) (and .cse14 (<= ~max_loop~0 2) (let ((.cse18 (<= ~num~0 1))) (or (and .cse5 .cse15 .cse16 .cse17 .cse7 .cse8 .cse18 .cse3 .cse19 .cse12 .cse4) (and .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse3 .cse19 .cse12 .cse4)))) (and .cse20 .cse7 .cse13 .cse2 .cse3 .cse4) (and .cse20 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse15 .cse16 .cse17 .cse14 .cse7 .cse8 (<= ~num~0 2147483647) (<= ~max_loop~0 ~i~0) .cse3 .cse19 .cse12) (and .cse13 .cse1 .cse3 (<= 1 ~num~0) .cse4) (and .cse5 .cse15 .cse16 .cse6 .cse7 .cse8 (<= 1 ~P_1_pc~0) .cse2 .cse3 .cse12))) [2022-12-13 21:18:33,842 INFO L895 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-12-13 21:18:33,842 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 21:18:33,842 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point L438(line 438) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2022-12-13 21:18:33,843 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2022-12-13 21:18:33,843 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point read_data_returnLabel#1(lines 32 54) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 0 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))) (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483647) .cse3 .cse4 .cse5))) [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point $Ultimate##55(lines 156 186) the Hoare annotation is: (let ((.cse17 (= ~P_1_st~0 0))) (let ((.cse13 (<= ~max_loop~0 2)) (.cse18 (<= ~num~0 1)) (.cse15 (<= 1 ~num~0)) (.cse6 (not .cse17)) (.cse7 (<= 1 ~i~0)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse11 (= ~P_1_pc~0 1)) (.cse14 (<= ~num~0 2147483647)) (.cse19 (<= 0 ~num~0)) (.cse0 (= ~i~0 0)) (.cse1 (<= ~e~0 0)) (.cse12 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (= ~max_loop~0 2)) (.cse22 (<= ~C_1_ev~0 0)) (.cse2 (= ~P_1_pc~0 0)) (.cse3 (= ~C_1_pc~0 0)) (.cse4 (= ~num~0 0)) (.cse5 (not (= ~C_1_st~0 0))) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse17 .cse13 .cse18 .cse5 .cse19 .cse16) (and .cse11 .cse0 .cse1 .cse12 .cse20 .cse21 .cse22 .cse3 .cse18 .cse5 .cse15 .cse16 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse14 (<= ~max_loop~0 ~i~0) .cse5 .cse19 .cse16) (and .cse0 .cse1 .cse12 .cse20 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse16)))) [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 489 498) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2022-12-13 21:18:33,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point L158(lines 158 168) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 1 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))) (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483647) .cse3 .cse4 .cse5))) [2022-12-13 21:18:33,843 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-12-13 21:18:33,843 INFO L895 garLoopResultBuilder]: At program point L241-1(lines 232 249) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-12-13 21:18:33,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-12-13 21:18:33,844 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 93 104) the Hoare annotation is: (let ((.cse15 (= ~C_1_st~0 0)) (.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse12 (<= ~num~0 1)) (.cse14 (= 2 ~C_1_pc~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse17 (<= 0 ~num~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse11 (not .cse19)) (.cse18 (<= ~num~0 2147483647)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse13 (<= 1 ~num~0)) (.cse3 (= ~C_1_pc~0 1)) (.cse0 (<= 1 ~i~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse8 (not .cse15)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~C_1_ev~0 0)) (.cse22 (= ~P_1_pc~0 0)) (.cse7 (= ~num~0 0)) (.cse9 (= ~C_1_i~0 1)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse12 .cse8 .cse13 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse16 .cse4 .cse5 (<= ~max_loop~0 2) .cse12 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse16 .cse4 .cse5 .cse18 .cse19 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse6 .cse8 .cse13 .cse9 .cse10) (and .cse3 (or (and .cse0 .cse4 .cse5 .cse20 (<= ~i~0 1) .cse21 .cse22 .cse7 .cse8 .cse10) (and .cse0 .cse2 .cse5 (or (and .cse4 (< 1 ~P_1_pc~0) .cse7 .cse8 .cse10) (and .cse4 .cse22 .cse7 .cse8 .cse10)))) .cse9) (and .cse15 (= ~i~0 0) .cse4 .cse5 .cse20 (= ~max_loop~0 2) .cse21 .cse22 (= ~C_1_pc~0 0) .cse7 .cse9 .cse10)))) [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 499 520) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-12-13 21:18:33,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-12-13 21:18:33,844 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,844 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-12-13 21:18:33,845 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-12-13 21:18:33,845 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,846 INFO L895 garLoopResultBuilder]: At program point L426(lines 415 428) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 271 325) the Hoare annotation is: (let ((.cse14 (<= ~max_loop~0 ~i~0))) (let ((.cse13 (<= ~num~0 2147483647)) (.cse12 (= ~P_1_pc~0 1)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse15 (<= 0 ~num~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (= ~C_1_pc~0 1)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~i~0 1)) (.cse24 (<= ~C_1_ev~0 0)) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse19 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (not (= ~P_1_st~0 0))) (.cse18 (not .cse14)) (.cse20 (<= 1 ~num~0)) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse18 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse13 .cse19 .cse3 .cse20 .cse16 .cse4) (and .cse8 .cse9 .cse10 .cse17 .cse7 .cse19 .cse2 .cse3 .cse16 .cse4) (and .cse12 (<= ~max_loop~0 2) (or (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse21 .cse3 .cse15 .cse16 .cse4) (and .cse8 .cse11 .cse7 .cse22 .cse23 .cse24 .cse21 .cse3 .cse15 .cse16 .cse4))) (and .cse6 .cse7 .cse5 .cse3 .cse20 .cse4) (and .cse5 .cse1 .cse3 .cse20 .cse4) (and (= ~i~0 0) .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse17 (or (and .cse8 .cse7 .cse22 .cse23 .cse24 .cse19 .cse21 .cse3 .cse4) (and .cse8 .cse10 .cse7 .cse19 .cse21 .cse3 .cse4)) .cse18 .cse20 .cse16)))) [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 21:18:33,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-12-13 21:18:33,847 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 445 482) the Hoare annotation is: (let ((.cse22 (<= ~max_loop~0 ~i~0)) (.cse20 (= ~P_1_st~0 0)) (.cse14 (= ~C_1_st~0 0))) (let ((.cse21 (<= ~num~0 2147483647)) (.cse19 (= ~P_1_pc~0 1)) (.cse27 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse18 (= 2 ~C_1_pc~0)) (.cse23 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse15 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse16 (<= ~P_1_ev~0 0)) (.cse28 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse25 (<= ~num~0 1)) (.cse3 (not .cse14)) (.cse4 (not .cse20)) (.cse24 (not .cse22)) (.cse26 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse9 .cse16 (= ~max_loop~0 2) .cse17 .cse0 .cse1 .cse2 .cse11) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse18 .cse14 .cse19 .cse9 .cse20 .cse21 .cse22 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse21 .cse22 .cse3 .cse23 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse25 .cse3 .cse26 .cse11) (and .cse5 .cse6 .cse7 .cse18 .cse14 .cse19 .cse9 .cse20 .cse27 .cse25 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse21 .cse10 .cse3 .cse26 .cse11) (and .cse19 .cse27 (or (and .cse5 .cse6 .cse7 .cse18 .cse9 .cse25 .cse3 .cse23 .cse11 .cse4) (and .cse5 .cse18 .cse9 .cse16 .cse28 .cse17 .cse25 .cse3 .cse23 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse26 .cse4) (and .cse12 .cse1 .cse3 .cse26 .cse4) (and .cse15 .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse16 .cse28 .cse17 .cse10 .cse25 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse25 .cse3 .cse4)) .cse24 .cse26 .cse11)))) [2022-12-13 21:18:33,847 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse26 (<= ~max_loop~0 ~i~0)) (.cse29 (= ~P_1_st~0 0)) (.cse17 (= ~C_1_st~0 0))) (let ((.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse20 (= ~max_loop~0 2)) (.cse27 (<= 0 ~num~0)) (.cse23 (<= ~C_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse24 (= 2 ~C_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse30 (<= ~max_loop~0 2)) (.cse25 (<= ~num~0 2147483647)) (.cse16 (< 1 ~P_1_pc~0)) (.cse19 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse6 (= ~C_1_pc~0 1)) (.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~i~0 1)) (.cse11 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse7 (<= ~e~0 0)) (.cse15 (<= 1 ~P_1_pc~0)) (.cse21 (<= ~num~0 1)) (.cse3 (not .cse17)) (.cse4 (not .cse29)) (.cse28 (not .cse26)) (.cse22 (<= 1 ~num~0)) (.cse12 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse3 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse2 .cse3 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse8 .cse9 .cse20 .cse11 .cse1 .cse21 .cse22 .cse12 .cse4) (and .cse23 .cse7 .cse16 .cse2 .cse3 .cse4) (and .cse17 .cse19 .cse7 .cse9 .cse20 .cse11 .cse0 .cse1 .cse2 .cse12) (and .cse23 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse18 .cse7 .cse25 .cse26 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 .cse15 .cse21 .cse3 .cse22 .cse12) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse29 .cse30 .cse21 .cse27 .cse12) (and .cse5 .cse13 .cse14 .cse6 .cse7 .cse28 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse25 .cse15 .cse3 .cse22 .cse12) (and .cse18 .cse30 (or (and .cse5 .cse13 .cse14 .cse24 .cse7 .cse21 .cse3 .cse27 .cse12 .cse4) (and .cse5 .cse24 .cse7 .cse9 .cse10 .cse11 .cse21 .cse3 .cse27 .cse12 .cse4))) (and .cse23 .cse7 .cse16 .cse3 .cse22 .cse4) (and .cse5 .cse13 .cse14 .cse24 .cse17 .cse18 .cse7 .cse30 .cse25 .cse22 .cse12 .cse4) (and .cse16 .cse1 .cse3 .cse22 .cse4) (and .cse19 .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse6 (or (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse15 .cse21 .cse3 .cse4) (and .cse5 .cse14 .cse7 .cse15 .cse21 .cse3 .cse4)) .cse28 .cse22 .cse12)))) [2022-12-13 21:18:33,847 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2022-12-13 21:18:33,847 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-12-13 21:18:33,847 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0)) [2022-12-13 21:18:33,847 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 55 73) the Hoare annotation is: (let ((.cse3 (= ~C_1_st~0 0))) (let ((.cse13 (<= ~P_1_ev~0 0)) (.cse14 (<= ~C_1_ev~0 0)) (.cse15 (= ~num~0 0)) (.cse0 (<= 1 ~i~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse12 (or (= ~P_1_pc~0 0) (<= 1 ~P_1_pc~0))) (.cse11 (= ~C_1_pc~0 1)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse6 (not (<= ~max_loop~0 ~i~0))) (.cse7 (<= ~num~0 |ULTIMATE.start_write_data_~i___0#1|)) (.cse8 (<= ~num~0 1)) (.cse16 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse10 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= 2 ~C_1_pc~0) .cse3 (= ~P_1_pc~0 1) .cse4 .cse5 .cse6 (<= ~max_loop~0 2) .cse7 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse11 .cse6 (or (and .cse0 .cse12 .cse4 .cse5 .cse13 (<= ~i~0 1) .cse14 .cse15 .cse16 .cse10) (and .cse0 .cse2 .cse12 .cse4 .cse5 .cse15 .cse16 .cse10)) .cse7 .cse9) (and .cse12 .cse3 (= ~i~0 0) .cse4 .cse5 .cse13 (= ~max_loop~0 2) .cse7 .cse14 (= ~C_1_pc~0 0) .cse15 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 (<= 1 ~num~0) .cse9 .cse10)))) [2022-12-13 21:18:33,847 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-12-13 21:18:33,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-12-13 21:18:33,847 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-12-13 21:18:33,848 INFO L895 garLoopResultBuilder]: At program point L51(lines 36 53) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (not (= ~C_1_st~0 0))) (.cse4 (<= 0 ~num~0)) (.cse5 (= ~C_1_i~0 1))) (or (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= ~num~0 1) .cse3 .cse4 .cse5 (not (= ~P_1_st~0 0))) (and (<= 1 ~i~0) (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 (not (<= ~max_loop~0 ~i~0)) (<= ~max_loop~0 2) (<= ~num~0 2147483647) .cse3 .cse4 .cse5))) [2022-12-13 21:18:33,848 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 411 429) the Hoare annotation is: (let ((.cse19 (<= ~max_loop~0 ~i~0)) (.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse18 (<= ~num~0 2147483647)) (.cse16 (= ~P_1_pc~0 1)) (.cse24 (<= ~max_loop~0 2)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse14 (= 2 ~C_1_pc~0)) (.cse20 (<= 0 ~num~0)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse8 (= ~C_1_pc~0 1)) (.cse25 (<= ~P_1_ev~0 0)) (.cse26 (<= ~i~0 1)) (.cse27 (<= ~C_1_ev~0 0)) (.cse5 (<= 1 ~i~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse9 (<= ~e~0 0)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse22 (<= ~num~0 1)) (.cse3 (not .cse15)) (.cse4 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (<= 1 ~num~0)) (.cse11 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse16 .cse9 .cse18 .cse19 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse24 .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse16 .cse24 (or (and .cse5 .cse6 .cse7 .cse14 .cse9 .cse22 .cse3 .cse20 .cse11 .cse4) (and .cse5 .cse14 .cse9 .cse25 .cse26 .cse27 .cse22 .cse3 .cse20 .cse11 .cse4))) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4) (and .cse8 (or (and .cse5 .cse9 .cse25 .cse26 .cse27 .cse10 .cse22 .cse3 .cse4) (and .cse5 .cse7 .cse9 .cse10 .cse22 .cse3 .cse4)) .cse21 .cse23 .cse11)))) [2022-12-13 21:18:33,848 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2022-12-13 21:18:33,848 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-12-13 21:18:33,848 INFO L895 garLoopResultBuilder]: At program point L365-1(lines 356 373) the Hoare annotation is: (let ((.cse17 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0)) (.cse19 (<= ~max_loop~0 ~i~0))) (let ((.cse14 (= 2 ~C_1_pc~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse22 (<= ~num~0 1)) (.cse20 (<= 0 ~num~0)) (.cse5 (<= 1 ~i~0)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse8 (= ~C_1_pc~0 1)) (.cse21 (not .cse19)) (.cse18 (<= ~num~0 2147483647)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse11 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse12 (< 1 ~P_1_pc~0)) (.cse3 (not .cse15)) (.cse23 (<= 1 ~num~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse12 .cse2 .cse3 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 .cse18 .cse19 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse3 .cse23 .cse11) (and .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 .cse9 .cse17 (<= ~max_loop~0 2) .cse22 .cse20 .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) .cse18 .cse10 .cse3 .cse23 .cse11) (and .cse13 .cse9 .cse12 .cse3 .cse23 .cse4) (and .cse12 .cse1 .cse3 .cse23 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4)))) [2022-12-13 21:18:33,848 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-12-13 21:18:33,848 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2022-12-13 21:18:33,848 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-12-13 21:18:33,850 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:18:33,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:18:33,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:18:33 BoogieIcfgContainer [2022-12-13 21:18:33,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:18:33,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:18:33,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:18:33,906 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:18:33,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:23" (3/4) ... [2022-12-13 21:18:33,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-13 21:18:33,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-13 21:18:33,918 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-12-13 21:18:33,918 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 21:18:33,918 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 21:18:33,919 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 21:18:33,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) && ((((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(P_1_pc == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num)) [2022-12-13 21:18:33,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((!(C_1_pc <= 1) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0)) && (((((!(C_1_pc == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) [2022-12-13 21:18:33,937 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1)) && ((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((!(C_1_pc <= 1) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && (((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(C_1_i == 1)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((!(C_1_pc == 0) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || (((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) [2022-12-13 21:18:33,937 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((!(C_1_pc == 0) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && (((((!(C_1_i == 1) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((!(C_1_pc <= 1) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && (((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) [2022-12-13 21:18:33,957 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:18:33,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:18:33,957 INFO L158 Benchmark]: Toolchain (without parser) took 71505.47ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 86.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 252.0MB. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory was 87.9MB in the beginning and 87.9MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.51ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 73.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.98ms. Allocated memory is still 123.7MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 123.7MB. Free memory was 71.6MB in the beginning and 70.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: RCFGBuilder took 428.21ms. Allocated memory is still 123.7MB. Free memory was 70.0MB in the beginning and 51.9MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: TraceAbstraction took 70730.35ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-12-13 21:18:33,958 INFO L158 Benchmark]: Witness Printer took 50.91ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 21:18:33,959 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory was 87.9MB in the beginning and 87.9MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.51ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 73.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.98ms. Allocated memory is still 123.7MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 123.7MB. Free memory was 71.6MB in the beginning and 70.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 428.21ms. Allocated memory is still 123.7MB. Free memory was 70.0MB in the beginning and 51.9MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70730.35ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 50.91ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 70.6s, OverallIterations: 37, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6577 mSDsluCounter, 17179 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10057 mSDsCounter, 834 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3599 IncrementalHoareTripleChecker+Invalid, 4433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 834 mSolverCounterUnsat, 7122 mSDtfsCounter, 3599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6566 GetRequests, 6343 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13761occurred in iteration=24, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 9689 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 21589 PreInvPairs, 23020 NumberOfFragments, 14105 HoareAnnotationTreeSize, 21589 FomulaSimplifications, 178510 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 130780 FormulaSimplificationTreeSizeReductionInter, 28.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 11762 NumberOfCodeBlocks, 11762 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 12133 ConstructedInterpolants, 0 QuantifiedInterpolants, 19663 SizeOfPredicates, 9 NumberOfNonLiveVariables, 12186 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 58 InterpolantComputations, 35 PerfectInterpolantSequences, 22287/22820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0))) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && C_1_ev == 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && P_1_ev == 1) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && C_1_ev == 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((1 <= i && C_1_pc == 1) && e <= 0) && P_1_ev == 1) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && P_1_ev == 1) && max_loop <= 2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_ev == 1) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1)) && ((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((1 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || \old(C_1_st) == 0)) && ((((((!(C_1_pc <= 1) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && (((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(C_1_i == 1)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((0 <= __retres1 && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && __retres1 <= 0)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && (((((((((((((((((0 <= __retres1 && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || ((((0 <= __retres1 && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((!(C_1_pc == 0) || ((((((((((__retres1 <= 0 && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && __retres1 <= 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || (((((0 <= __retres1 && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc)) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((!(C_1_pc <= 1) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= \result) && 1 <= __retres1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || \old(C_1_st) == 0)) && (((((!(C_1_pc == 0) || ((((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((((__retres1 <= 0 && 0 <= __retres1) && 0 <= \result) && \result <= 0) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: P_1_pc == 0 || 1 <= P_1_pc - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(P_1_pc == 0)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(0 <= num)) || ((((((1 <= __retres1 && 1 <= \result) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= \result) && 1 <= __retres1) && 1 <= tmp)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((!(C_1_pc == 0) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && (((((!(C_1_i == 1) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || !(1 <= num))) && ((((((P_1_pc <= 1 || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((!(C_1_pc <= 1) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0)) || ((((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && P_1_pc == 0) && 0 <= \result) && __retres1 <= 0))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || (((((((((((__retres1 <= 0 && \result <= 0) && 0 <= __retres1) && 0 < tmp + 1) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && tmp <= 0) && 0 <= \result) && __retres1 <= 0)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && (((((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0) || ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)))) || !(max_loop <= 2)) || !(P_1_pc == 1))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((((((((((((((((\result <= 0 && 0 <= __retres1) && P_1_st == 0) && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0) || !(1 <= i)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 1 <= P_1_pc) && 0 <= \result) && __retres1 <= 0)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && (((((P_1_pc <= 1 || !(C_1_pc == 0)) || \old(P_1_st) == 0) || ((((((\result <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || ((((((\result <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && 2 <= C_1_pc) && \old(P_1_st) == P_1_st) && 0 <= \result) && __retres1 <= 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(0 <= num)) || !(e <= 0)) || \old(C_1_st) == 0) && ((((((((((!(1 <= i) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || \old(P_1_st) == 0) || !(0 <= num)) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0))) || !(max_loop <= 2)) || !(P_1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) && ((((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && (((((((((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st) && P_1_pc == 0) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || !(P_1_pc == 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0)) || !(1 <= P_1_pc))) && (((((!(C_1_i == 1) || (((((((!(1 <= i) || !(num <= 1)) || !(2 <= P_1_ev)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= P_1_pc)) && ((((((((!(1 <= i) || !(num <= 1)) || \old(P_1_st) == 0) || !(i <= 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || \old(C_1_st) == 0) || !(C_1_ev <= 0)) || !(1 <= P_1_pc)))) || !(C_1_pc == 1)) || max_loop <= i) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(1 <= P_1_pc))) && ((((((((((((!(1 <= i) || !(num <= 1)) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(num == 0))) && ((((((\old(P_1_st) == 0 || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(P_1_pc == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && 1 <= __retres1)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0)) && ((((((((((((!(1 <= i) || !(P_1_ev == 1)) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(num <= 2147483647)) || !(C_1_pc == 1)) || \old(P_1_st) == 0) || !(C_1_ev == 1)) || max_loop <= i) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num)) || !(1 <= P_1_pc))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(num == 0))) && ((((((((((((!(2 <= C_1_ev) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || \old(P_1_st) == 0) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || \old(C_1_st) == 0) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st))) && ((((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc <= 1)) || \old(P_1_st) == 0) || !(e <= 0)) || \old(C_1_st) == 0) || !(1 <= num))) && ((((((((((!(C_1_i == 1) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || (((__retres1 <= 0 && 0 <= __retres1) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(num == 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && (((((P_1_pc <= 1 || ((((__retres1 <= 0 && 0 <= __retres1) && 1 < P_1_pc) && C_1_st == \old(C_1_st)) && \old(P_1_st) == P_1_st)) || !(C_1_pc == 0)) || \old(P_1_st) == 0) || \old(C_1_st) == 0) || !(1 <= num)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((C_1_pc == 1 && ((((((((((1 <= i && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((1 <= i && 2 <= P_1_ev) && 1 <= tmp___2) && (((((e <= 0 && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((e <= 0 && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)))))) && C_1_i == 1)) || (((((((((((C_1_st == 0 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_st == 0) && max_loop <= 2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((((((((i == 0 && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) && !(P_1_st == 0)) || ((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((((C_1_st == 0 && P_1_pc == 1) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((C_1_pc == 1 && !(max_loop <= i)) && ((((((((((1 <= i && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && 1 <= num) && C_1_i == 1)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && max_loop <= 2) && num <= 2147483647) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_st == 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(C_1_i == 1)) || !(C_1_pc == P_1_pc)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(C_1_st == 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(P_1_st == 0)) || !(i == 0)) && ((((((((((((1 <= __retres1 || !(num <= 1)) || !(C_1_i == 1)) || !(C_1_pc == 0)) || P_1_st == 0) || !(P_1_pc == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(P_1_ev <= 0)) || !(C_1_st == 0)) || !(1 <= num)) || !(C_1_ev <= 0)) || !(i == 0))) && ((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(num <= 1)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= 2)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) || !(P_1_st == 0))) && (((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_st == 0))) && ((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) || !(P_1_st == 0))) && ((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || P_1_st == 0) || !(max_loop <= 2)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) || !(1 <= num))) && ((((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(num <= 2147483647)) || !(2 <= P_1_ev)) || !(C_1_pc == 1)) || max_loop <= i) || !(e <= 0)) || !(1 <= num)) || !(1 <= P_1_pc)) || !(P_1_st == 0))) && (((((((((((1 <= __retres1 || !(1 <= i)) || !(C_1_i == 1)) || C_1_st == 0) || !(C_1_pc == 1)) || !(i <= 1)) || !(e <= 0)) || !(P_1_pc == 0)) || !(P_1_ev <= 0)) || !(num == 0)) || !(C_1_ev <= 0)) || !(P_1_st == 0))) && (((((((((((1 <= __retres1 || !(2 <= C_1_ev)) || !(1 <= i)) || !(C_1_i == 1)) || !(num <= 2147483647)) || !(2 == C_1_pc)) || !(2 <= P_1_ev)) || !(max_loop <= i)) || !(0 <= num)) || !(P_1_pc == 1)) || !(e <= 0)) || !(C_1_st == 0)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= i___0) && num <= 1) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((C_1_pc == 1 && !(max_loop <= i)) && ((((((((((1 <= i && (P_1_pc == 0 || 1 <= P_1_pc)) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((1 <= i && 2 <= P_1_ev) && (P_1_pc == 0 || 1 <= P_1_pc)) && e <= 0) && 1 <= tmp___2) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)))) && num <= i___0) && C_1_i == 1)) || (((((((((((((P_1_pc == 0 || 1 <= P_1_pc) && C_1_st == 0) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && num <= i___0) && C_1_ev <= 0) && C_1_pc == 0) && num == 0) && C_1_i == 1) && !(P_1_st == 0))) || (((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && (P_1_pc == 0 || 1 <= P_1_pc)) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && num <= i___0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0)) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: P_1_pc == 0 || 1 <= P_1_pc - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((i == 0 && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((((i == 0 && e <= 0) && P_1_ev <= 0) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0)) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((((((((((((C_1_st == 0 && P_1_pc == 1) && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((C_1_st == 0 && i == 0) && e <= 0) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && C_1_i == 1)) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num <= 2147483647) && max_loop <= i) && 0 <= num) && C_1_i == 1)) || ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && P_1_st == 0) && max_loop <= 2) && num <= 1) && 0 <= num) && C_1_i == 1)) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && !(max_loop <= i)) && 1 <= i___0) && num <= 2147483647) && 1 <= P_1_pc) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1)) || ((P_1_pc == 1 && max_loop <= 2) && ((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && C_1_st == 0) && P_1_pc == 1) && e <= 0) && max_loop <= 2) && num <= 2147483647) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0))) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((i == 0 && e <= 0) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && !(P_1_st == 0))) || ((((C_1_pc == 1 && (((((((((1 <= i && e <= 0) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((1 <= i && 2 <= P_1_ev) && e <= 0) && 1 <= P_1_pc) && num <= 1) && !(C_1_st == 0)) && !(P_1_st == 0)))) && !(max_loop <= i)) && 1 <= num) && C_1_i == 1) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((P_1_pc == 0 && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || ((P_1_pc == 1 && max_loop <= 2) && (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && e <= 0) && 1 <= tmp___2) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0)) || (((((((((((1 <= i && 2 == C_1_pc) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && i <= 1) && C_1_ev <= 0) && num <= 1) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1) && !(P_1_st == 0))))) || (((((C_1_pc <= 1 && e <= 0) && 1 < P_1_pc) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((C_1_pc <= 1 && e <= 0) && P_1_pc == 0) && num == 0) && !(C_1_st == 0)) && !(P_1_st == 0))) || (((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && num <= 2147483647) && max_loop <= i) && !(C_1_st == 0)) && 0 <= num) && C_1_i == 1)) || ((((1 < P_1_pc && C_1_pc == 0) && !(C_1_st == 0)) && 1 <= num) && !(P_1_st == 0))) || (((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && C_1_pc == 1) && e <= 0) && 1 <= tmp___2) && 1 <= P_1_pc) && num == 0) && !(C_1_st == 0)) && C_1_i == 1) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((P_1_pc == 1 && i == 0) && e <= 0) && 1 <= tmp___2) && P_1_ev <= 0) && max_loop == 2) && C_1_ev <= 0) && C_1_pc == 0) && num <= 1) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) && !(P_1_st == 0)) || ((((((((((((1 <= i && 2 <= C_1_ev) && 2 <= P_1_ev) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && 1 <= tmp___2) && !(max_loop <= i)) && max_loop <= 2) && num <= 2147483647) && !(C_1_st == 0)) && 1 <= num) && C_1_i == 1) RESULT: Ultimate proved your program to be correct! [2022-12-13 21:18:33,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89a5d9f4-e9c9-4918-a4a5-bf431953118f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE