./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 0e0057cc 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_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:36:02,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:36:03,017 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 00:36:03,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:36:03,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:36:03,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:36:03,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:36:03,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:36:03,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:36:03,049 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:36:03,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:36:03,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:36:03,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:36:03,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:36:03,052 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:36:03,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:36:03,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:36:03,054 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:36:03,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:36:03,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:36:03,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:36:03,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:36:03,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:36:03,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:36:03,057 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:36:03,057 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:36:03,057 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:36:03,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:36:03,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:36:03,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:36:03,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:36:03,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:36:03,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:36:03,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:03,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:36:03,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:36:03,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:36:03,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:36:03,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:36:03,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:36:03,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:36:03,062 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:36:03,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:36:03,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:36:03,063 INFO L153 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_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/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_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 00:36:03,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:36:03,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:36:03,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:36:03,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:36:03,309 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:36:03,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-29 00:36:06,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:36:06,263 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:36:06,264 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-29 00:36:06,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/data/2b2d4595c/95308529720f4f51bf5676c8b478a0ed/FLAGa03c09407 [2023-11-29 00:36:06,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/data/2b2d4595c/95308529720f4f51bf5676c8b478a0ed [2023-11-29 00:36:06,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:36:06,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:36:06,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:06,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:36:06,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:36:06,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afbb877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06, skipping insertion in model container [2023-11-29 00:36:06,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,339 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:36:06,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:06,559 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:36:06,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:06,617 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:36:06,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06 WrapperNode [2023-11-29 00:36:06,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:06,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:06,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:36:06,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:36:06,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,667 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 271 [2023-11-29 00:36:06,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:06,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:36:06,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:36:06,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:36:06,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:36:06,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:36:06,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:36:06,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:36:06,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:36:06,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (1/1) ... [2023-11-29 00:36:06,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:06,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:36:06,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:36:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:36:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-29 00:36:06,792 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-29 00:36:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 00:36:06,792 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 00:36:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 00:36:06,793 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 00:36:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 00:36:06,793 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 00:36:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 00:36:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 00:36:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:36:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 00:36:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 00:36:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:36:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:36:06,872 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:36:06,874 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:36:07,184 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:36:07,231 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:36:07,231 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:36:07,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:07 BoogieIcfgContainer [2023-11-29 00:36:07,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:36:07,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:36:07,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:36:07,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:36:07,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:36:06" (1/3) ... [2023-11-29 00:36:07,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7079e64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:07, skipping insertion in model container [2023-11-29 00:36:07,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:06" (2/3) ... [2023-11-29 00:36:07,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7079e64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:07, skipping insertion in model container [2023-11-29 00:36:07,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:07" (3/3) ... [2023-11-29 00:36:07,242 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-11-29 00:36:07,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:36:07,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 00:36:07,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:36:07,310 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=LoopHeads, 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;@4f006d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:36:07,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:36:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 79 states have (on average 1.620253164556962) internal successors, (128), 90 states have internal predecessors, (128), 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) [2023-11-29 00:36:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 00:36:07,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:07,325 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] [2023-11-29 00:36:07,325 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)] === [2023-11-29 00:36:07,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash -563630169, now seen corresponding path program 1 times [2023-11-29 00:36:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620603998] [2023-11-29 00:36:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:36:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:36:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620603998] [2023-11-29 00:36:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620603998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549597455] [2023-11-29 00:36:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:07,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:07,742 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.620253164556962) internal successors, (128), 90 states have internal predecessors, (128), 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 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-29 00:36:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:08,091 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2023-11-29 00:36:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:08,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 42 [2023-11-29 00:36:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:08,106 INFO L225 Difference]: With dead ends: 324 [2023-11-29 00:36:08,106 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 00:36:08,110 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 [2023-11-29 00:36:08,114 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 297 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:08,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 620 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 00:36:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 178. [2023-11-29 00:36:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 148 states have internal predecessors, (208), 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) [2023-11-29 00:36:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 248 transitions. [2023-11-29 00:36:08,177 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 248 transitions. Word has length 42 [2023-11-29 00:36:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:08,178 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 248 transitions. [2023-11-29 00:36:08,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-29 00:36:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 248 transitions. [2023-11-29 00:36:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 00:36:08,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:08,181 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] [2023-11-29 00:36:08,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:36:08,181 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)] === [2023-11-29 00:36:08,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1535304856, now seen corresponding path program 1 times [2023-11-29 00:36:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226994938] [2023-11-29 00:36:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:36:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:36:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226994938] [2023-11-29 00:36:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226994938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151989339] [2023-11-29 00:36:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:08,342 INFO L87 Difference]: Start difference. First operand 178 states and 248 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-29 00:36:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:08,501 INFO L93 Difference]: Finished difference Result 364 states and 514 transitions. [2023-11-29 00:36:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 42 [2023-11-29 00:36:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:08,505 INFO L225 Difference]: With dead ends: 364 [2023-11-29 00:36:08,505 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 00:36:08,507 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 [2023-11-29 00:36:08,509 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 47 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:08,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 436 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 00:36:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2023-11-29 00:36:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 142 states have (on average 1.471830985915493) internal successors, (209), 150 states have internal predecessors, (209), 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) [2023-11-29 00:36:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2023-11-29 00:36:08,531 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 42 [2023-11-29 00:36:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:08,532 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2023-11-29 00:36:08,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-11-29 00:36:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2023-11-29 00:36:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 00:36:08,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:08,534 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] [2023-11-29 00:36:08,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:36:08,535 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)] === [2023-11-29 00:36:08,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1473265242, now seen corresponding path program 1 times [2023-11-29 00:36:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430605285] [2023-11-29 00:36:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:36:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:36:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430605285] [2023-11-29 00:36:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430605285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:08,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:08,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:36:08,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737202842] [2023-11-29 00:36:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:08,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:08,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:08,685 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2023-11-29 00:36:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:09,191 INFO L93 Difference]: Finished difference Result 718 states and 1000 transitions. [2023-11-29 00:36:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 42 [2023-11-29 00:36:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:09,198 INFO L225 Difference]: With dead ends: 718 [2023-11-29 00:36:09,198 INFO L226 Difference]: Without dead ends: 546 [2023-11-29 00:36:09,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:36:09,201 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 561 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:09,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 627 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:36:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-29 00:36:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 322. [2023-11-29 00:36:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.441860465116279) internal successors, (372), 266 states have internal predecessors, (372), 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) [2023-11-29 00:36:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 446 transitions. [2023-11-29 00:36:09,253 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 446 transitions. Word has length 42 [2023-11-29 00:36:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:09,253 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 446 transitions. [2023-11-29 00:36:09,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2023-11-29 00:36:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 446 transitions. [2023-11-29 00:36:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:09,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:09,255 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] [2023-11-29 00:36:09,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:36:09,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:09,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1784117039, now seen corresponding path program 1 times [2023-11-29 00:36:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064160398] [2023-11-29 00:36:09,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064160398] [2023-11-29 00:36:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064160398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143384171] [2023-11-29 00:36:09,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:09,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:09,342 INFO L87 Difference]: Start difference. First operand 322 states and 446 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:09,726 INFO L93 Difference]: Finished difference Result 1153 states and 1633 transitions. [2023-11-29 00:36:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 44 [2023-11-29 00:36:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:09,734 INFO L225 Difference]: With dead ends: 1153 [2023-11-29 00:36:09,734 INFO L226 Difference]: Without dead ends: 839 [2023-11-29 00:36:09,735 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 [2023-11-29 00:36:09,737 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 284 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:09,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 676 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:36:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2023-11-29 00:36:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 711. [2023-11-29 00:36:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 569 states have (on average 1.37609841827768) internal successors, (783), 577 states have internal predecessors, (783), 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) [2023-11-29 00:36:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 965 transitions. [2023-11-29 00:36:09,823 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 965 transitions. Word has length 44 [2023-11-29 00:36:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:09,824 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 965 transitions. [2023-11-29 00:36:09,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 965 transitions. [2023-11-29 00:36:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:09,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:09,825 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] [2023-11-29 00:36:09,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:36:09,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:09,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 453246226, now seen corresponding path program 1 times [2023-11-29 00:36:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614067764] [2023-11-29 00:36:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614067764] [2023-11-29 00:36:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614067764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777567674] [2023-11-29 00:36:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:09,913 INFO L87 Difference]: Start difference. First operand 711 states and 965 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:10,111 INFO L93 Difference]: Finished difference Result 1468 states and 2045 transitions. [2023-11-29 00:36:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 44 [2023-11-29 00:36:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:10,118 INFO L225 Difference]: With dead ends: 1468 [2023-11-29 00:36:10,118 INFO L226 Difference]: Without dead ends: 765 [2023-11-29 00:36:10,121 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 [2023-11-29 00:36:10,122 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 36 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:10,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 421 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-29 00:36:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 723. [2023-11-29 00:36:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 581 states have (on average 1.3614457831325302) internal successors, (791), 589 states have internal predecessors, (791), 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) [2023-11-29 00:36:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 973 transitions. [2023-11-29 00:36:10,213 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 973 transitions. Word has length 44 [2023-11-29 00:36:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:10,213 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 973 transitions. [2023-11-29 00:36:10,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 973 transitions. [2023-11-29 00:36:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:10,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:10,215 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] [2023-11-29 00:36:10,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:36:10,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:10,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 672100944, now seen corresponding path program 1 times [2023-11-29 00:36:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:10,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16248975] [2023-11-29 00:36:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:10,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16248975] [2023-11-29 00:36:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16248975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956977549] [2023-11-29 00:36:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:10,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:10,284 INFO L87 Difference]: Start difference. First operand 723 states and 973 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-11-29 00:36:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:10,542 INFO L93 Difference]: Finished difference Result 1941 states and 2648 transitions. [2023-11-29 00:36:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 44 [2023-11-29 00:36:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:10,552 INFO L225 Difference]: With dead ends: 1941 [2023-11-29 00:36:10,552 INFO L226 Difference]: Without dead ends: 1288 [2023-11-29 00:36:10,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:10,556 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 168 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 311 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2023-11-29 00:36:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1214. [2023-11-29 00:36:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 981 states have (on average 1.348623853211009) internal successors, (1323), 989 states have internal predecessors, (1323), 140 states have call successors, (140), 85 states have call predecessors, (140), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2023-11-29 00:36:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1629 transitions. [2023-11-29 00:36:10,677 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1629 transitions. Word has length 44 [2023-11-29 00:36:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:10,678 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 1629 transitions. [2023-11-29 00:36:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-11-29 00:36:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1629 transitions. [2023-11-29 00:36:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:10,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:10,679 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] [2023-11-29 00:36:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:36:10,680 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:10,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -405218120, now seen corresponding path program 1 times [2023-11-29 00:36:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745066831] [2023-11-29 00:36:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745066831] [2023-11-29 00:36:10,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745066831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:10,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538812319] [2023-11-29 00:36:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:10,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:10,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:10,778 INFO L87 Difference]: Start difference. First operand 1214 states and 1629 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:11,075 INFO L93 Difference]: Finished difference Result 3587 states and 4949 transitions. [2023-11-29 00:36:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 44 [2023-11-29 00:36:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:11,093 INFO L225 Difference]: With dead ends: 3587 [2023-11-29 00:36:11,093 INFO L226 Difference]: Without dead ends: 2382 [2023-11-29 00:36:11,098 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 [2023-11-29 00:36:11,099 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 203 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:11,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 325 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2023-11-29 00:36:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2332. [2023-11-29 00:36:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1869 states have (on average 1.317817014446228) internal successors, (2463), 1884 states have internal predecessors, (2463), 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) [2023-11-29 00:36:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3140 transitions. [2023-11-29 00:36:11,331 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3140 transitions. Word has length 44 [2023-11-29 00:36:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:11,331 INFO L495 AbstractCegarLoop]: Abstraction has 2332 states and 3140 transitions. [2023-11-29 00:36:11,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-29 00:36:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3140 transitions. [2023-11-29 00:36:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:36:11,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:11,333 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] [2023-11-29 00:36:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:36:11,334 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)] === [2023-11-29 00:36:11,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1245973799, now seen corresponding path program 1 times [2023-11-29 00:36:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111911023] [2023-11-29 00:36:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111911023] [2023-11-29 00:36:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111911023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:11,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151418783] [2023-11-29 00:36:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:11,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:11,397 INFO L87 Difference]: Start difference. First operand 2332 states and 3140 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2023-11-29 00:36:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:11,657 INFO L93 Difference]: Finished difference Result 2428 states and 3318 transitions. [2023-11-29 00:36:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 45 [2023-11-29 00:36:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:11,675 INFO L225 Difference]: With dead ends: 2428 [2023-11-29 00:36:11,675 INFO L226 Difference]: Without dead ends: 2426 [2023-11-29 00:36:11,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:11,677 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 153 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:11,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 180 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2023-11-29 00:36:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2330. [2023-11-29 00:36:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1869 states have (on average 1.3113964686998394) internal successors, (2451), 1882 states have internal predecessors, (2451), 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) [2023-11-29 00:36:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3128 transitions. [2023-11-29 00:36:11,862 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3128 transitions. Word has length 45 [2023-11-29 00:36:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:11,863 INFO L495 AbstractCegarLoop]: Abstraction has 2330 states and 3128 transitions. [2023-11-29 00:36:11,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2023-11-29 00:36:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3128 transitions. [2023-11-29 00:36:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 00:36:11,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:11,865 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] [2023-11-29 00:36:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:36:11,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:11,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -29517641, now seen corresponding path program 1 times [2023-11-29 00:36:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883444662] [2023-11-29 00:36:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883444662] [2023-11-29 00:36:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883444662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215815143] [2023-11-29 00:36:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:11,925 INFO L87 Difference]: Start difference. First operand 2330 states and 3128 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2023-11-29 00:36:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:12,256 INFO L93 Difference]: Finished difference Result 2752 states and 3729 transitions. [2023-11-29 00:36:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 46 [2023-11-29 00:36:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:12,274 INFO L225 Difference]: With dead ends: 2752 [2023-11-29 00:36:12,275 INFO L226 Difference]: Without dead ends: 2750 [2023-11-29 00:36:12,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:12,277 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:12,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 318 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2023-11-29 00:36:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2642. [2023-11-29 00:36:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2128 states have (on average 1.305921052631579) internal successors, (2779), 2142 states have internal predecessors, (2779), 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) [2023-11-29 00:36:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3532 transitions. [2023-11-29 00:36:12,511 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3532 transitions. Word has length 46 [2023-11-29 00:36:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:12,512 INFO L495 AbstractCegarLoop]: Abstraction has 2642 states and 3532 transitions. [2023-11-29 00:36:12,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2023-11-29 00:36:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3532 transitions. [2023-11-29 00:36:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:36:12,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:12,513 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] [2023-11-29 00:36:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:36:12,514 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:12,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1455544979, now seen corresponding path program 1 times [2023-11-29 00:36:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719789155] [2023-11-29 00:36:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719789155] [2023-11-29 00:36:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719789155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951683285] [2023-11-29 00:36:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:12,593 INFO L87 Difference]: Start difference. First operand 2642 states and 3532 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2023-11-29 00:36:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:13,023 INFO L93 Difference]: Finished difference Result 4727 states and 6409 transitions. [2023-11-29 00:36:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 52 [2023-11-29 00:36:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:13,044 INFO L225 Difference]: With dead ends: 4727 [2023-11-29 00:36:13,044 INFO L226 Difference]: Without dead ends: 3043 [2023-11-29 00:36:13,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:13,051 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:13,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 523 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2023-11-29 00:36:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2918. [2023-11-29 00:36:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2351 states have (on average 1.301999149298171) internal successors, (3061), 2366 states have internal predecessors, (3061), 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) [2023-11-29 00:36:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 3890 transitions. [2023-11-29 00:36:13,302 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 3890 transitions. Word has length 52 [2023-11-29 00:36:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:13,302 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 3890 transitions. [2023-11-29 00:36:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2023-11-29 00:36:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3890 transitions. [2023-11-29 00:36:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 00:36:13,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:13,304 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] [2023-11-29 00:36:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:36:13,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:13,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2122745645, now seen corresponding path program 1 times [2023-11-29 00:36:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432548064] [2023-11-29 00:36:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432548064] [2023-11-29 00:36:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432548064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199307861] [2023-11-29 00:36:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:13,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:13,382 INFO L87 Difference]: Start difference. First operand 2918 states and 3890 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2023-11-29 00:36:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:13,830 INFO L93 Difference]: Finished difference Result 4531 states and 6125 transitions. [2023-11-29 00:36:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 53 [2023-11-29 00:36:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:13,860 INFO L225 Difference]: With dead ends: 4531 [2023-11-29 00:36:13,860 INFO L226 Difference]: Without dead ends: 4529 [2023-11-29 00:36:13,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:13,864 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 352 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:13,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 420 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2023-11-29 00:36:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4330. [2023-11-29 00:36:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 3498 states have (on average 1.2998856489422528) internal successors, (4547), 3518 states have internal predecessors, (4547), 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) [2023-11-29 00:36:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 5770 transitions. [2023-11-29 00:36:14,192 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 5770 transitions. Word has length 53 [2023-11-29 00:36:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:14,192 INFO L495 AbstractCegarLoop]: Abstraction has 4330 states and 5770 transitions. [2023-11-29 00:36:14,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2023-11-29 00:36:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 5770 transitions. [2023-11-29 00:36:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:36:14,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:14,195 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] [2023-11-29 00:36:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:36:14,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:14,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -651249944, now seen corresponding path program 1 times [2023-11-29 00:36:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147512732] [2023-11-29 00:36:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:36:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147512732] [2023-11-29 00:36:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147512732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:14,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741639014] [2023-11-29 00:36:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:14,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:14,278 INFO L87 Difference]: Start difference. First operand 4330 states and 5770 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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) [2023-11-29 00:36:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:14,958 INFO L93 Difference]: Finished difference Result 11920 states and 16283 transitions. [2023-11-29 00:36:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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 64 [2023-11-29 00:36:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:15,015 INFO L225 Difference]: With dead ends: 11920 [2023-11-29 00:36:15,015 INFO L226 Difference]: Without dead ends: 7604 [2023-11-29 00:36:15,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:15,032 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 413 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:15,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 500 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7604 states. [2023-11-29 00:36:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7604 to 7355. [2023-11-29 00:36:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7355 states, 5845 states have (on average 1.276988879384089) internal successors, (7464), 5915 states have internal predecessors, (7464), 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) [2023-11-29 00:36:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 10035 transitions. [2023-11-29 00:36:15,585 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 10035 transitions. Word has length 64 [2023-11-29 00:36:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 7355 states and 10035 transitions. [2023-11-29 00:36:15,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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) [2023-11-29 00:36:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 10035 transitions. [2023-11-29 00:36:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 00:36:15,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:15,589 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:15,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:36:15,590 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:15,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 653335513, now seen corresponding path program 1 times [2023-11-29 00:36:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679486461] [2023-11-29 00:36:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:36:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679486461] [2023-11-29 00:36:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679486461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:36:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086075453] [2023-11-29 00:36:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:15,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:15,676 INFO L87 Difference]: Start difference. First operand 7355 states and 10035 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2023-11-29 00:36:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:16,541 INFO L93 Difference]: Finished difference Result 14813 states and 20186 transitions. [2023-11-29 00:36:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:36:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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 73 [2023-11-29 00:36:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:16,579 INFO L225 Difference]: With dead ends: 14813 [2023-11-29 00:36:16,580 INFO L226 Difference]: Without dead ends: 7091 [2023-11-29 00:36:16,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:36:16,602 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 613 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:16,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 702 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:36:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7091 states. [2023-11-29 00:36:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7091 to 6893. [2023-11-29 00:36:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6893 states, 5477 states have (on average 1.2594486032499543) internal successors, (6898), 5546 states have internal predecessors, (6898), 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) [2023-11-29 00:36:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 9167 transitions. [2023-11-29 00:36:17,089 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 9167 transitions. Word has length 73 [2023-11-29 00:36:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,090 INFO L495 AbstractCegarLoop]: Abstraction has 6893 states and 9167 transitions. [2023-11-29 00:36:17,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2023-11-29 00:36:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 9167 transitions. [2023-11-29 00:36:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:36:17,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,101 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:17,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:36:17,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:17,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1330255051, now seen corresponding path program 1 times [2023-11-29 00:36:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4001016] [2023-11-29 00:36:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:36:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:36:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:36:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:36:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:36:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:36:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:36:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:17,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4001016] [2023-11-29 00:36:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4001016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517583637] [2023-11-29 00:36:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:17,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:17,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:36:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:17,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 00:36:17,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517583637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-29 00:36:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707342459] [2023-11-29 00:36:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:17,513 INFO L87 Difference]: Start difference. First operand 6893 states and 9167 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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) [2023-11-29 00:36:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,819 INFO L93 Difference]: Finished difference Result 10743 states and 14398 transitions. [2023-11-29 00:36:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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 114 [2023-11-29 00:36:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,834 INFO L225 Difference]: With dead ends: 10743 [2023-11-29 00:36:17,834 INFO L226 Difference]: Without dead ends: 4993 [2023-11-29 00:36:17,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:17,847 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2023-11-29 00:36:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4993. [2023-11-29 00:36:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 3963 states have (on average 1.2457734039868786) internal successors, (4937), 4010 states have internal predecessors, (4937), 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) [2023-11-29 00:36:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 6524 transitions. [2023-11-29 00:36:18,070 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 6524 transitions. Word has length 114 [2023-11-29 00:36:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:18,070 INFO L495 AbstractCegarLoop]: Abstraction has 4993 states and 6524 transitions. [2023-11-29 00:36:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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) [2023-11-29 00:36:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 6524 transitions. [2023-11-29 00:36:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 00:36:18,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:18,077 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:18,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:18,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:36:18,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:18,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -894123077, now seen corresponding path program 1 times [2023-11-29 00:36:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335224256] [2023-11-29 00:36:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:36:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:36:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:36:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:36:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 00:36:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 00:36:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 00:36:18,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:18,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335224256] [2023-11-29 00:36:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335224256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:18,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156689563] [2023-11-29 00:36:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:18,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:18,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:36:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:18,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:36:18,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156689563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-29 00:36:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102987495] [2023-11-29 00:36:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:18,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:18,647 INFO L87 Difference]: Start difference. First operand 4993 states and 6524 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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) [2023-11-29 00:36:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,032 INFO L93 Difference]: Finished difference Result 11410 states and 14807 transitions. [2023-11-29 00:36:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:19,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 117 [2023-11-29 00:36:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,054 INFO L225 Difference]: With dead ends: 11410 [2023-11-29 00:36:19,054 INFO L226 Difference]: Without dead ends: 7560 [2023-11-29 00:36:19,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:19,069 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 244 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2023-11-29 00:36:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 7557. [2023-11-29 00:36:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7557 states, 5977 states have (on average 1.2220177346494898) internal successors, (7304), 6034 states have internal predecessors, (7304), 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) [2023-11-29 00:36:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7557 states to 7557 states and 9571 transitions. [2023-11-29 00:36:19,471 INFO L78 Accepts]: Start accepts. Automaton has 7557 states and 9571 transitions. Word has length 117 [2023-11-29 00:36:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,471 INFO L495 AbstractCegarLoop]: Abstraction has 7557 states and 9571 transitions. [2023-11-29 00:36:19,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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) [2023-11-29 00:36:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 7557 states and 9571 transitions. [2023-11-29 00:36:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 00:36:19,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,477 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:19,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:36:19,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:36:19,678 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:19,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1023890701, now seen corresponding path program 1 times [2023-11-29 00:36:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198160699] [2023-11-29 00:36:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:36:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:36:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:36:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 00:36:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198160699] [2023-11-29 00:36:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198160699] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469691878] [2023-11-29 00:36:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:19,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:19,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:19,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:36:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:19,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 00:36:20,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469691878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:20,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-29 00:36:20,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204417825] [2023-11-29 00:36:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:20,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:20,034 INFO L87 Difference]: Start difference. First operand 7557 states and 9571 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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) [2023-11-29 00:36:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:20,537 INFO L93 Difference]: Finished difference Result 12450 states and 15943 transitions. [2023-11-29 00:36:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 125 [2023-11-29 00:36:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:20,561 INFO L225 Difference]: With dead ends: 12450 [2023-11-29 00:36:20,561 INFO L226 Difference]: Without dead ends: 5828 [2023-11-29 00:36:20,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:20,581 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 238 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2023-11-29 00:36:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 5828. [2023-11-29 00:36:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5828 states, 4606 states have (on average 1.2305688232739904) internal successors, (5668), 4653 states have internal predecessors, (5668), 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) [2023-11-29 00:36:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5828 states to 5828 states and 7491 transitions. [2023-11-29 00:36:21,026 INFO L78 Accepts]: Start accepts. Automaton has 5828 states and 7491 transitions. Word has length 125 [2023-11-29 00:36:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:21,026 INFO L495 AbstractCegarLoop]: Abstraction has 5828 states and 7491 transitions. [2023-11-29 00:36:21,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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) [2023-11-29 00:36:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5828 states and 7491 transitions. [2023-11-29 00:36:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-29 00:36:21,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:21,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:21,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:21,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:36:21,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:21,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 978962494, now seen corresponding path program 1 times [2023-11-29 00:36:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489965069] [2023-11-29 00:36:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:36:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:36:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:36:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:36:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:36:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:36:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:36:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-11-29 00:36:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489965069] [2023-11-29 00:36:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489965069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86143794] [2023-11-29 00:36:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:21,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:21,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:21,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:36:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:21,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:36:21,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86143794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-29 00:36:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705102652] [2023-11-29 00:36:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:21,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:21,537 INFO L87 Difference]: Start difference. First operand 5828 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2023-11-29 00:36:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:21,756 INFO L93 Difference]: Finished difference Result 7816 states and 10157 transitions. [2023-11-29 00:36:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 135 [2023-11-29 00:36:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:21,764 INFO L225 Difference]: With dead ends: 7816 [2023-11-29 00:36:21,764 INFO L226 Difference]: Without dead ends: 3334 [2023-11-29 00:36:21,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:21,772 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:21,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 221 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2023-11-29 00:36:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3331. [2023-11-29 00:36:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2645 states have (on average 1.2196597353497165) internal successors, (3226), 2671 states have internal predecessors, (3226), 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) [2023-11-29 00:36:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4169 transitions. [2023-11-29 00:36:21,912 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4169 transitions. Word has length 135 [2023-11-29 00:36:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:21,912 INFO L495 AbstractCegarLoop]: Abstraction has 3331 states and 4169 transitions. [2023-11-29 00:36:21,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2023-11-29 00:36:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4169 transitions. [2023-11-29 00:36:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:36:21,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:21,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:21,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:36:22,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:36:22,117 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)] === [2023-11-29 00:36:22,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -56779719, now seen corresponding path program 1 times [2023-11-29 00:36:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303392526] [2023-11-29 00:36:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:36:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:36:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:36:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 00:36:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:36:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 00:36:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 00:36:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303392526] [2023-11-29 00:36:22,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303392526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:22,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436363305] [2023-11-29 00:36:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:22,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:22,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:22,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:22,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:36:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:22,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 00:36:22,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436363305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:22,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-29 00:36:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116782917] [2023-11-29 00:36:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:22,423 INFO L87 Difference]: Start difference. First operand 3331 states and 4169 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2023-11-29 00:36:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:22,733 INFO L93 Difference]: Finished difference Result 7974 states and 10036 transitions. [2023-11-29 00:36:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:22,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 145 [2023-11-29 00:36:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:22,749 INFO L225 Difference]: With dead ends: 7974 [2023-11-29 00:36:22,749 INFO L226 Difference]: Without dead ends: 5141 [2023-11-29 00:36:22,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:22,756 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 97 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:22,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 335 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2023-11-29 00:36:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 5133. [2023-11-29 00:36:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 4119 states have (on average 1.201262442340374) internal successors, (4948), 4156 states have internal predecessors, (4948), 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) [2023-11-29 00:36:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 6325 transitions. [2023-11-29 00:36:23,102 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 6325 transitions. Word has length 145 [2023-11-29 00:36:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:23,103 INFO L495 AbstractCegarLoop]: Abstraction has 5133 states and 6325 transitions. [2023-11-29 00:36:23,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2023-11-29 00:36:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 6325 transitions. [2023-11-29 00:36:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:36:23,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:23,107 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:23,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:36:23,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:36:23,312 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:23,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 972579579, now seen corresponding path program 1 times [2023-11-29 00:36:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:23,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228527407] [2023-11-29 00:36:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:36:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:36:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:36:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 00:36:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:36:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 00:36:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 00:36:23,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228527407] [2023-11-29 00:36:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228527407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242828238] [2023-11-29 00:36:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:23,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:23,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:23,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:23,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:36:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:36:23,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:36:23,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242828238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-11-29 00:36:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287144068] [2023-11-29 00:36:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:23,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:36:23,636 INFO L87 Difference]: Start difference. First operand 5133 states and 6325 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2023-11-29 00:36:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:23,858 INFO L93 Difference]: Finished difference Result 8286 states and 10258 transitions. [2023-11-29 00:36:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:23,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 145 [2023-11-29 00:36:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:23,868 INFO L225 Difference]: With dead ends: 8286 [2023-11-29 00:36:23,868 INFO L226 Difference]: Without dead ends: 3166 [2023-11-29 00:36:23,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:36:23,876 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 54 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:23,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 577 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2023-11-29 00:36:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 2986. [2023-11-29 00:36:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2495 states have (on average 1.2100200400801604) internal successors, (3019), 2506 states have internal predecessors, (3019), 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) [2023-11-29 00:36:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3675 transitions. [2023-11-29 00:36:24,048 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3675 transitions. Word has length 145 [2023-11-29 00:36:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:24,048 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 3675 transitions. [2023-11-29 00:36:24,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2023-11-29 00:36:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3675 transitions. [2023-11-29 00:36:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 00:36:24,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:24,051 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-11-29 00:36:24,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:36:24,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:24,258 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:24,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash 664972876, now seen corresponding path program 1 times [2023-11-29 00:36:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620588516] [2023-11-29 00:36:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:36:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:36:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 00:36:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 00:36:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:36:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 00:36:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:24,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620588516] [2023-11-29 00:36:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620588516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273245342] [2023-11-29 00:36:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:24,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:24,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:24,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:36:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:24,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 00:36:24,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273245342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-29 00:36:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638832756] [2023-11-29 00:36:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:24,573 INFO L87 Difference]: Start difference. First operand 2986 states and 3675 transitions. Second operand has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2023-11-29 00:36:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:24,724 INFO L93 Difference]: Finished difference Result 2986 states and 3675 transitions. [2023-11-29 00:36:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 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 148 [2023-11-29 00:36:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:24,732 INFO L225 Difference]: With dead ends: 2986 [2023-11-29 00:36:24,732 INFO L226 Difference]: Without dead ends: 2984 [2023-11-29 00:36:24,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:24,734 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:24,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2023-11-29 00:36:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2984. [2023-11-29 00:36:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2495 states have (on average 1.2012024048096193) internal successors, (2997), 2504 states have internal predecessors, (2997), 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) [2023-11-29 00:36:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3653 transitions. [2023-11-29 00:36:24,915 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3653 transitions. Word has length 148 [2023-11-29 00:36:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:24,916 INFO L495 AbstractCegarLoop]: Abstraction has 2984 states and 3653 transitions. [2023-11-29 00:36:24,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2023-11-29 00:36:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3653 transitions. [2023-11-29 00:36:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 00:36:24,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:24,918 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:24,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:36:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:25,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:25,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2031069771, now seen corresponding path program 1 times [2023-11-29 00:36:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311192228] [2023-11-29 00:36:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:36:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:36:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 00:36:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 00:36:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:36:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 00:36:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311192228] [2023-11-29 00:36:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311192228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016293644] [2023-11-29 00:36:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:25,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:25,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:36:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:25,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:36:25,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016293644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:25,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:25,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-29 00:36:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352753270] [2023-11-29 00:36:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:25,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:25,357 INFO L87 Difference]: Start difference. First operand 2984 states and 3653 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-29 00:36:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:25,547 INFO L93 Difference]: Finished difference Result 5316 states and 6616 transitions. [2023-11-29 00:36:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 [2023-11-29 00:36:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:25,556 INFO L225 Difference]: With dead ends: 5316 [2023-11-29 00:36:25,556 INFO L226 Difference]: Without dead ends: 2925 [2023-11-29 00:36:25,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:25,561 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 82 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:25,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 297 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2023-11-29 00:36:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2924. [2023-11-29 00:36:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2435 states have (on average 1.188911704312115) internal successors, (2895), 2444 states have internal predecessors, (2895), 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) [2023-11-29 00:36:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3551 transitions. [2023-11-29 00:36:25,737 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3551 transitions. Word has length 151 [2023-11-29 00:36:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:25,737 INFO L495 AbstractCegarLoop]: Abstraction has 2924 states and 3551 transitions. [2023-11-29 00:36:25,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-29 00:36:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3551 transitions. [2023-11-29 00:36:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 00:36:25,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:25,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:25,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:36:25,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 00:36:25,946 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)] === [2023-11-29 00:36:25,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 366337742, now seen corresponding path program 1 times [2023-11-29 00:36:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869092330] [2023-11-29 00:36:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:36:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869092330] [2023-11-29 00:36:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869092330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907543359] [2023-11-29 00:36:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:26,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:26,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:26,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:36:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:26,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 00:36:26,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:36:26,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907543359] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:26,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:36:26,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 3] total 6 [2023-11-29 00:36:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865635440] [2023-11-29 00:36:26,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:36:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:36:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:26,486 INFO L87 Difference]: Start difference. First operand 2924 states and 3551 transitions. Second operand has 7 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 4 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 00:36:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:27,268 INFO L93 Difference]: Finished difference Result 9480 states and 11664 transitions. [2023-11-29 00:36:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:36:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 4 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 152 [2023-11-29 00:36:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:27,299 INFO L225 Difference]: With dead ends: 9480 [2023-11-29 00:36:27,299 INFO L226 Difference]: Without dead ends: 9472 [2023-11-29 00:36:27,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:27,303 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 425 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:27,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 517 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:36:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2023-11-29 00:36:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 7686. [2023-11-29 00:36:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 6469 states have (on average 1.1978667491111454) internal successors, (7749), 6492 states have internal predecessors, (7749), 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) [2023-11-29 00:36:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 9497 transitions. [2023-11-29 00:36:27,960 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 9497 transitions. Word has length 152 [2023-11-29 00:36:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:27,961 INFO L495 AbstractCegarLoop]: Abstraction has 7686 states and 9497 transitions. [2023-11-29 00:36:27,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 4 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-11-29 00:36:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 9497 transitions. [2023-11-29 00:36:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 00:36:27,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:27,963 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:27,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:36:28,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 00:36:28,164 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)] === [2023-11-29 00:36:28,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1747904501, now seen corresponding path program 1 times [2023-11-29 00:36:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220361438] [2023-11-29 00:36:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:36:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220361438] [2023-11-29 00:36:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220361438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:28,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126237145] [2023-11-29 00:36:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:28,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:28,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:28,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:28,301 INFO L87 Difference]: Start difference. First operand 7686 states and 9497 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-29 00:36:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:29,160 INFO L93 Difference]: Finished difference Result 21068 states and 26239 transitions. [2023-11-29 00:36:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 160 [2023-11-29 00:36:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:29,183 INFO L225 Difference]: With dead ends: 21068 [2023-11-29 00:36:29,183 INFO L226 Difference]: Without dead ends: 14844 [2023-11-29 00:36:29,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:29,192 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 349 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:29,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 357 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14844 states. [2023-11-29 00:36:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14844 to 9723. [2023-11-29 00:36:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 8157 states have (on average 1.196640921907564) internal successors, (9761), 8188 states have internal predecessors, (9761), 886 states have call successors, (886), 550 states have call predecessors, (886), 676 states have return successors, (1371), 984 states have call predecessors, (1371), 886 states have call successors, (1371) [2023-11-29 00:36:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 12018 transitions. [2023-11-29 00:36:29,678 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 12018 transitions. Word has length 160 [2023-11-29 00:36:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:29,678 INFO L495 AbstractCegarLoop]: Abstraction has 9723 states and 12018 transitions. [2023-11-29 00:36:29,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-29 00:36:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 12018 transitions. [2023-11-29 00:36:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 00:36:29,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:29,682 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:36:29,682 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:29,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2015921007, now seen corresponding path program 1 times [2023-11-29 00:36:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671437459] [2023-11-29 00:36:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:36:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 00:36:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 00:36:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:36:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 00:36:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:36:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:36:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:36:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671437459] [2023-11-29 00:36:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671437459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:36:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657918271] [2023-11-29 00:36:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:29,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:36:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:36:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:29,792 INFO L87 Difference]: Start difference. First operand 9723 states and 12018 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 00:36:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:30,512 INFO L93 Difference]: Finished difference Result 20242 states and 25116 transitions. [2023-11-29 00:36:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:36:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 161 [2023-11-29 00:36:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:30,533 INFO L225 Difference]: With dead ends: 20242 [2023-11-29 00:36:30,533 INFO L226 Difference]: Without dead ends: 12774 [2023-11-29 00:36:30,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:36:30,542 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 176 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:30,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 736 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12774 states. [2023-11-29 00:36:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12774 to 12325. [2023-11-29 00:36:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12325 states, 10311 states have (on average 1.1966831539132965) internal successors, (12339), 10350 states have internal predecessors, (12339), 1142 states have call successors, (1142), 706 states have call predecessors, (1142), 868 states have return successors, (1799), 1268 states have call predecessors, (1799), 1142 states have call successors, (1799) [2023-11-29 00:36:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12325 states to 12325 states and 15280 transitions. [2023-11-29 00:36:31,185 INFO L78 Accepts]: Start accepts. Automaton has 12325 states and 15280 transitions. Word has length 161 [2023-11-29 00:36:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:31,185 INFO L495 AbstractCegarLoop]: Abstraction has 12325 states and 15280 transitions. [2023-11-29 00:36:31,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 00:36:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 12325 states and 15280 transitions. [2023-11-29 00:36:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 00:36:31,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:31,190 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:31,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:36:31,190 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:31,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -553165859, now seen corresponding path program 1 times [2023-11-29 00:36:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644975989] [2023-11-29 00:36:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:36:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 00:36:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 00:36:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:36:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 00:36:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:36:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:36:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:36:31,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644975989] [2023-11-29 00:36:31,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644975989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:31,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:31,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468798073] [2023-11-29 00:36:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:31,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:31,326 INFO L87 Difference]: Start difference. First operand 12325 states and 15280 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-29 00:36:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:32,161 INFO L93 Difference]: Finished difference Result 15675 states and 19438 transitions. [2023-11-29 00:36:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 162 [2023-11-29 00:36:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:32,196 INFO L225 Difference]: With dead ends: 15675 [2023-11-29 00:36:32,196 INFO L226 Difference]: Without dead ends: 15673 [2023-11-29 00:36:32,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:32,202 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 233 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:32,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 612 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15673 states. [2023-11-29 00:36:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15673 to 12325. [2023-11-29 00:36:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12325 states, 10311 states have (on average 1.1966831539132965) internal successors, (12339), 10350 states have internal predecessors, (12339), 1142 states have call successors, (1142), 706 states have call predecessors, (1142), 868 states have return successors, (1799), 1268 states have call predecessors, (1799), 1142 states have call successors, (1799) [2023-11-29 00:36:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12325 states to 12325 states and 15280 transitions. [2023-11-29 00:36:32,974 INFO L78 Accepts]: Start accepts. Automaton has 12325 states and 15280 transitions. Word has length 162 [2023-11-29 00:36:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:32,974 INFO L495 AbstractCegarLoop]: Abstraction has 12325 states and 15280 transitions. [2023-11-29 00:36:32,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-29 00:36:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12325 states and 15280 transitions. [2023-11-29 00:36:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-11-29 00:36:32,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:32,980 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:32,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:36:32,980 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)] === [2023-11-29 00:36:32,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2078643530, now seen corresponding path program 1 times [2023-11-29 00:36:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82424162] [2023-11-29 00:36:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:36:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:36:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:36:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:36:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:36:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:36:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 00:36:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:36:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 00:36:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 00:36:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 00:36:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 00:36:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-11-29 00:36:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82424162] [2023-11-29 00:36:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82424162] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310161954] [2023-11-29 00:36:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:33,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:33,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:33,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:36:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:33,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-29 00:36:33,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310161954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 00:36:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378479377] [2023-11-29 00:36:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:33,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:33,257 INFO L87 Difference]: Start difference. First operand 12325 states and 15280 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2023-11-29 00:36:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:34,114 INFO L93 Difference]: Finished difference Result 31923 states and 39667 transitions. [2023-11-29 00:36:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 207 [2023-11-29 00:36:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:34,144 INFO L225 Difference]: With dead ends: 31923 [2023-11-29 00:36:34,144 INFO L226 Difference]: Without dead ends: 19984 [2023-11-29 00:36:34,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:34,159 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 63 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:34,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 317 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19984 states. [2023-11-29 00:36:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19984 to 19873. [2023-11-29 00:36:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19873 states, 16567 states have (on average 1.188326190619907) internal successors, (19687), 16606 states have internal predecessors, (19687), 1920 states have call successors, (1920), 1191 states have call predecessors, (1920), 1382 states have return successors, (2874), 2075 states have call predecessors, (2874), 1920 states have call successors, (2874) [2023-11-29 00:36:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19873 states to 19873 states and 24481 transitions. [2023-11-29 00:36:35,185 INFO L78 Accepts]: Start accepts. Automaton has 19873 states and 24481 transitions. Word has length 207 [2023-11-29 00:36:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:35,185 INFO L495 AbstractCegarLoop]: Abstraction has 19873 states and 24481 transitions. [2023-11-29 00:36:35,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2023-11-29 00:36:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19873 states and 24481 transitions. [2023-11-29 00:36:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-11-29 00:36:35,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:35,196 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:35,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:35,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:35,397 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)] === [2023-11-29 00:36:35,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 211934856, now seen corresponding path program 1 times [2023-11-29 00:36:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041521291] [2023-11-29 00:36:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:36:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:36:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:36:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:36:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:36:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:36:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 00:36:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:36:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 00:36:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 00:36:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 00:36:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 00:36:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-11-29 00:36:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041521291] [2023-11-29 00:36:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041521291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267665139] [2023-11-29 00:36:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:35,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:35,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:35,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:35,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:36:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:35,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 00:36:35,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267665139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:35,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 00:36:35,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551949012] [2023-11-29 00:36:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:35,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:35,639 INFO L87 Difference]: Start difference. First operand 19873 states and 24481 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2023-11-29 00:36:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:36,081 INFO L93 Difference]: Finished difference Result 27930 states and 34485 transitions. [2023-11-29 00:36:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 207 [2023-11-29 00:36:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:36,096 INFO L225 Difference]: With dead ends: 27930 [2023-11-29 00:36:36,096 INFO L226 Difference]: Without dead ends: 8394 [2023-11-29 00:36:36,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:36,116 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 245 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2023-11-29 00:36:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 8170. [2023-11-29 00:36:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8170 states, 6747 states have (on average 1.165703275529865) internal successors, (7865), 6779 states have internal predecessors, (7865), 791 states have call successors, (791), 533 states have call predecessors, (791), 628 states have return successors, (1253), 857 states have call predecessors, (1253), 791 states have call successors, (1253) [2023-11-29 00:36:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 9909 transitions. [2023-11-29 00:36:36,576 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 9909 transitions. Word has length 207 [2023-11-29 00:36:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:36,576 INFO L495 AbstractCegarLoop]: Abstraction has 8170 states and 9909 transitions. [2023-11-29 00:36:36,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2023-11-29 00:36:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 9909 transitions. [2023-11-29 00:36:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-29 00:36:36,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:36,582 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:36,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:36:36,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:36,783 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)] === [2023-11-29 00:36:36,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1454998970, now seen corresponding path program 1 times [2023-11-29 00:36:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753965558] [2023-11-29 00:36:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:36:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:36:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:36:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:36:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:36:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:36:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 00:36:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:36:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 00:36:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:36:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-29 00:36:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 00:36:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 00:36:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 00:36:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2023-11-29 00:36:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753965558] [2023-11-29 00:36:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753965558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221782291] [2023-11-29 00:36:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:36,906 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:36,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 00:36:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:37,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:36:37,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 299 proven. 1 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 00:36:37,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 78 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2023-11-29 00:36:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221782291] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:37,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:36:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2023-11-29 00:36:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102366893] [2023-11-29 00:36:37,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:37,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:36:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:36:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:37,330 INFO L87 Difference]: Start difference. First operand 8170 states and 9909 transitions. Second operand has 8 states, 8 states have (on average 24.125) internal successors, (193), 7 states have internal predecessors, (193), 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) [2023-11-29 00:36:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:38,012 INFO L93 Difference]: Finished difference Result 16183 states and 19585 transitions. [2023-11-29 00:36:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:36:38,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 7 states have internal predecessors, (193), 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 227 [2023-11-29 00:36:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:38,025 INFO L225 Difference]: With dead ends: 16183 [2023-11-29 00:36:38,025 INFO L226 Difference]: Without dead ends: 8278 [2023-11-29 00:36:38,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 503 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:36:38,035 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 322 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:38,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 738 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2023-11-29 00:36:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 8140. [2023-11-29 00:36:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8140 states, 6713 states have (on average 1.1388350960822284) internal successors, (7645), 6761 states have internal predecessors, (7645), 784 states have call successors, (784), 528 states have call predecessors, (784), 639 states have return successors, (1058), 850 states have call predecessors, (1058), 784 states have call successors, (1058) [2023-11-29 00:36:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 9487 transitions. [2023-11-29 00:36:38,642 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 9487 transitions. Word has length 227 [2023-11-29 00:36:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:38,642 INFO L495 AbstractCegarLoop]: Abstraction has 8140 states and 9487 transitions. [2023-11-29 00:36:38,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 7 states have internal predecessors, (193), 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) [2023-11-29 00:36:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 9487 transitions. [2023-11-29 00:36:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-29 00:36:38,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:38,650 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:38,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 00:36:38,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 00:36:38,851 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)] === [2023-11-29 00:36:38,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1138736764, now seen corresponding path program 1 times [2023-11-29 00:36:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854223922] [2023-11-29 00:36:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:36:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:36:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:36:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:36:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:36:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 00:36:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 00:36:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:36:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 00:36:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 00:36:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 00:36:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-29 00:36:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 00:36:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 00:36:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2023-11-29 00:36:38,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854223922] [2023-11-29 00:36:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854223922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:38,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294823159] [2023-11-29 00:36:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:38,940 INFO L87 Difference]: Start difference. First operand 8140 states and 9487 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-29 00:36:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:39,417 INFO L93 Difference]: Finished difference Result 8429 states and 9813 transitions. [2023-11-29 00:36:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 229 [2023-11-29 00:36:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:39,431 INFO L225 Difference]: With dead ends: 8429 [2023-11-29 00:36:39,431 INFO L226 Difference]: Without dead ends: 8176 [2023-11-29 00:36:39,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:39,434 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 156 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:39,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 176 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2023-11-29 00:36:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8118. [2023-11-29 00:36:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8118 states, 6697 states have (on average 1.1390174705091831) internal successors, (7628), 6745 states have internal predecessors, (7628), 781 states have call successors, (781), 525 states have call predecessors, (781), 636 states have return successors, (1055), 847 states have call predecessors, (1055), 781 states have call successors, (1055) [2023-11-29 00:36:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8118 states to 8118 states and 9464 transitions. [2023-11-29 00:36:39,924 INFO L78 Accepts]: Start accepts. Automaton has 8118 states and 9464 transitions. Word has length 229 [2023-11-29 00:36:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:39,924 INFO L495 AbstractCegarLoop]: Abstraction has 8118 states and 9464 transitions. [2023-11-29 00:36:39,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-29 00:36:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8118 states and 9464 transitions. [2023-11-29 00:36:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-29 00:36:39,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:39,930 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:36:39,930 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)] === [2023-11-29 00:36:39,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1803020724, now seen corresponding path program 1 times [2023-11-29 00:36:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:39,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095413703] [2023-11-29 00:36:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:36:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 00:36:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:36:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:36:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:36:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:36:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 00:36:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:36:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:36:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 00:36:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:36:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 00:36:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:36:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 00:36:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 00:36:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 00:36:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-29 00:36:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-11-29 00:36:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095413703] [2023-11-29 00:36:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095413703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445695919] [2023-11-29 00:36:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:40,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:40,034 INFO L87 Difference]: Start difference. First operand 8118 states and 9464 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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) [2023-11-29 00:36:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:40,505 INFO L93 Difference]: Finished difference Result 8177 states and 9535 transitions. [2023-11-29 00:36:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 234 [2023-11-29 00:36:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:40,516 INFO L225 Difference]: With dead ends: 8177 [2023-11-29 00:36:40,516 INFO L226 Difference]: Without dead ends: 7942 [2023-11-29 00:36:40,519 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 [2023-11-29 00:36:40,520 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 92 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:40,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 253 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2023-11-29 00:36:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 7884. [2023-11-29 00:36:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7884 states, 6501 states have (on average 1.1399784648515614) internal successors, (7411), 6549 states have internal predecessors, (7411), 760 states have call successors, (760), 510 states have call predecessors, (760), 619 states have return successors, (1032), 824 states have call predecessors, (1032), 760 states have call successors, (1032) [2023-11-29 00:36:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 9203 transitions. [2023-11-29 00:36:41,145 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 9203 transitions. Word has length 234 [2023-11-29 00:36:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:41,145 INFO L495 AbstractCegarLoop]: Abstraction has 7884 states and 9203 transitions. [2023-11-29 00:36:41,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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) [2023-11-29 00:36:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 9203 transitions. [2023-11-29 00:36:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-11-29 00:36:41,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:41,154 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:41,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:36:41,154 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)] === [2023-11-29 00:36:41,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1727107927, now seen corresponding path program 1 times [2023-11-29 00:36:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842977478] [2023-11-29 00:36:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 00:36:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:36:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 00:36:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 00:36:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 00:36:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 00:36:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:36:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 00:36:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 00:36:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 00:36:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 00:36:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-29 00:36:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 00:36:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 00:36:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:36:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 83 proven. 18 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2023-11-29 00:36:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842977478] [2023-11-29 00:36:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842977478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592382458] [2023-11-29 00:36:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:41,255 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:41,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 00:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:41,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:41,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-29 00:36:41,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592382458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-29 00:36:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365659921] [2023-11-29 00:36:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:41,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:41,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:41,448 INFO L87 Difference]: Start difference. First operand 7884 states and 9203 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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) [2023-11-29 00:36:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:41,837 INFO L93 Difference]: Finished difference Result 8213 states and 9583 transitions. [2023-11-29 00:36:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:41,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 247 [2023-11-29 00:36:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:41,848 INFO L225 Difference]: With dead ends: 8213 [2023-11-29 00:36:41,849 INFO L226 Difference]: Without dead ends: 7885 [2023-11-29 00:36:41,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:41,852 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 43 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:41,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 295 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7885 states. [2023-11-29 00:36:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7885 to 7884. [2023-11-29 00:36:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7884 states, 6501 states have (on average 1.1385940624519304) internal successors, (7402), 6549 states have internal predecessors, (7402), 760 states have call successors, (760), 510 states have call predecessors, (760), 619 states have return successors, (1032), 824 states have call predecessors, (1032), 760 states have call successors, (1032) [2023-11-29 00:36:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 9194 transitions. [2023-11-29 00:36:42,320 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 9194 transitions. Word has length 247 [2023-11-29 00:36:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:42,321 INFO L495 AbstractCegarLoop]: Abstraction has 7884 states and 9194 transitions. [2023-11-29 00:36:42,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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) [2023-11-29 00:36:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 9194 transitions. [2023-11-29 00:36:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-11-29 00:36:42,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:42,328 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 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, 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] [2023-11-29 00:36:42,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 00:36:42,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:42,529 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)] === [2023-11-29 00:36:42,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2084121623, now seen corresponding path program 1 times [2023-11-29 00:36:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094848400] [2023-11-29 00:36:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:36:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 00:36:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:36:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 00:36:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:36:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:36:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:36:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 00:36:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 00:36:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 00:36:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-29 00:36:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:36:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-29 00:36:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 00:36:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 00:36:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-29 00:36:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 00:36:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2023-11-29 00:36:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094848400] [2023-11-29 00:36:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094848400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:36:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050641382] [2023-11-29 00:36:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:42,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:36:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:36:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:42,702 INFO L87 Difference]: Start difference. First operand 7884 states and 9194 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 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) [2023-11-29 00:36:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:43,391 INFO L93 Difference]: Finished difference Result 17711 states and 20664 transitions. [2023-11-29 00:36:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:36:43,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 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 251 [2023-11-29 00:36:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:43,404 INFO L225 Difference]: With dead ends: 17711 [2023-11-29 00:36:43,404 INFO L226 Difference]: Without dead ends: 9507 [2023-11-29 00:36:43,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:43,412 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 138 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:43,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 446 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:36:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9507 states. [2023-11-29 00:36:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9507 to 9367. [2023-11-29 00:36:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9367 states, 7693 states have (on average 1.1347978681918627) internal successors, (8730), 7752 states have internal predecessors, (8730), 921 states have call successors, (921), 616 states have call predecessors, (921), 750 states have return successors, (1266), 998 states have call predecessors, (1266), 921 states have call successors, (1266) [2023-11-29 00:36:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9367 states to 9367 states and 10917 transitions. [2023-11-29 00:36:43,953 INFO L78 Accepts]: Start accepts. Automaton has 9367 states and 10917 transitions. Word has length 251 [2023-11-29 00:36:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:43,953 INFO L495 AbstractCegarLoop]: Abstraction has 9367 states and 10917 transitions. [2023-11-29 00:36:43,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 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) [2023-11-29 00:36:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9367 states and 10917 transitions. [2023-11-29 00:36:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-11-29 00:36:43,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:43,961 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:43,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 00:36:43,961 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:43,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -5544167, now seen corresponding path program 1 times [2023-11-29 00:36:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282891745] [2023-11-29 00:36:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:36:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 00:36:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 00:36:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 00:36:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 00:36:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 00:36:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 00:36:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-29 00:36:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2023-11-29 00:36:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282891745] [2023-11-29 00:36:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282891745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798549252] [2023-11-29 00:36:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:44,100 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:44,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 00:36:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:44,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:44,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 00:36:44,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798549252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 00:36:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107058244] [2023-11-29 00:36:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:44,311 INFO L87 Difference]: Start difference. First operand 9367 states and 10917 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2023-11-29 00:36:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:44,644 INFO L93 Difference]: Finished difference Result 14771 states and 17230 transitions. [2023-11-29 00:36:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 252 [2023-11-29 00:36:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:44,651 INFO L225 Difference]: With dead ends: 14771 [2023-11-29 00:36:44,651 INFO L226 Difference]: Without dead ends: 5624 [2023-11-29 00:36:44,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:44,661 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 49 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:44,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 276 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2023-11-29 00:36:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5479. [2023-11-29 00:36:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5479 states, 4638 states have (on average 1.122466580422596) internal successors, (5206), 4640 states have internal predecessors, (5206), 456 states have call successors, (456), 305 states have call predecessors, (456), 382 states have return successors, (584), 533 states have call predecessors, (584), 456 states have call successors, (584) [2023-11-29 00:36:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6246 transitions. [2023-11-29 00:36:44,937 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6246 transitions. Word has length 252 [2023-11-29 00:36:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:44,938 INFO L495 AbstractCegarLoop]: Abstraction has 5479 states and 6246 transitions. [2023-11-29 00:36:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2023-11-29 00:36:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6246 transitions. [2023-11-29 00:36:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-11-29 00:36:44,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:44,942 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:44,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 00:36:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:45,143 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:45,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1408120589, now seen corresponding path program 1 times [2023-11-29 00:36:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617246008] [2023-11-29 00:36:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:36:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 00:36:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 00:36:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-29 00:36:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 00:36:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 00:36:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 00:36:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-29 00:36:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2023-11-29 00:36:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617246008] [2023-11-29 00:36:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617246008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267969666] [2023-11-29 00:36:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:45,249 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:45,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 00:36:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:45,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:45,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-11-29 00:36:45,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267969666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 00:36:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581690732] [2023-11-29 00:36:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:45,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:45,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:45,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:45,402 INFO L87 Difference]: Start difference. First operand 5479 states and 6246 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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) [2023-11-29 00:36:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:45,711 INFO L93 Difference]: Finished difference Result 10401 states and 11949 transitions. [2023-11-29 00:36:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 253 [2023-11-29 00:36:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:45,717 INFO L225 Difference]: With dead ends: 10401 [2023-11-29 00:36:45,717 INFO L226 Difference]: Without dead ends: 4997 [2023-11-29 00:36:45,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:45,721 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:45,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 339 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2023-11-29 00:36:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 4997. [2023-11-29 00:36:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4997 states, 4233 states have (on average 1.1159933853059296) internal successors, (4724), 4235 states have internal predecessors, (4724), 436 states have call successors, (436), 305 states have call predecessors, (436), 325 states have return successors, (490), 456 states have call predecessors, (490), 436 states have call successors, (490) [2023-11-29 00:36:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 5650 transitions. [2023-11-29 00:36:45,976 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 5650 transitions. Word has length 253 [2023-11-29 00:36:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:45,977 INFO L495 AbstractCegarLoop]: Abstraction has 4997 states and 5650 transitions. [2023-11-29 00:36:45,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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) [2023-11-29 00:36:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 5650 transitions. [2023-11-29 00:36:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-11-29 00:36:45,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:45,981 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 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, 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] [2023-11-29 00:36:45,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 00:36:46,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 00:36:46,182 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:46,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1233023834, now seen corresponding path program 1 times [2023-11-29 00:36:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29253818] [2023-11-29 00:36:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 00:36:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 00:36:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-29 00:36:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:36:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-29 00:36:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 00:36:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 00:36:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 00:36:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 00:36:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2023-11-29 00:36:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:46,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29253818] [2023-11-29 00:36:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29253818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092417724] [2023-11-29 00:36:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:46,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:46,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:46,270 INFO L87 Difference]: Start difference. First operand 4997 states and 5650 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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) [2023-11-29 00:36:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:46,594 INFO L93 Difference]: Finished difference Result 8333 states and 9433 transitions. [2023-11-29 00:36:46,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:46,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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 260 [2023-11-29 00:36:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:46,600 INFO L225 Difference]: With dead ends: 8333 [2023-11-29 00:36:46,600 INFO L226 Difference]: Without dead ends: 3809 [2023-11-29 00:36:46,604 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 [2023-11-29 00:36:46,605 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 148 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:46,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 286 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2023-11-29 00:36:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3557. [2023-11-29 00:36:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 2985 states have (on average 1.1068676716917922) internal successors, (3304), 2995 states have internal predecessors, (3304), 324 states have call successors, (324), 229 states have call predecessors, (324), 245 states have return successors, (366), 332 states have call predecessors, (366), 324 states have call successors, (366) [2023-11-29 00:36:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 3994 transitions. [2023-11-29 00:36:46,805 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 3994 transitions. Word has length 260 [2023-11-29 00:36:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:46,805 INFO L495 AbstractCegarLoop]: Abstraction has 3557 states and 3994 transitions. [2023-11-29 00:36:46,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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) [2023-11-29 00:36:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 3994 transitions. [2023-11-29 00:36:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-11-29 00:36:46,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:46,810 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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] [2023-11-29 00:36:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 00:36:46,811 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:46,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 705263474, now seen corresponding path program 1 times [2023-11-29 00:36:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033253181] [2023-11-29 00:36:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:36:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 00:36:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 00:36:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 00:36:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 00:36:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 00:36:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 00:36:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 00:36:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 00:36:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 00:36:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2023-11-29 00:36:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033253181] [2023-11-29 00:36:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033253181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647065647] [2023-11-29 00:36:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:46,888 INFO L87 Difference]: Start difference. First operand 3557 states and 3994 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 00:36:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:47,283 INFO L93 Difference]: Finished difference Result 7826 states and 8820 transitions. [2023-11-29 00:36:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 271 [2023-11-29 00:36:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:47,288 INFO L225 Difference]: With dead ends: 7826 [2023-11-29 00:36:47,288 INFO L226 Difference]: Without dead ends: 2945 [2023-11-29 00:36:47,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:47,293 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 100 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:47,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 353 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2023-11-29 00:36:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2722. [2023-11-29 00:36:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2257 states have (on average 1.096588391670359) internal successors, (2475), 2272 states have internal predecessors, (2475), 262 states have call successors, (262), 189 states have call predecessors, (262), 200 states have return successors, (295), 260 states have call predecessors, (295), 262 states have call successors, (295) [2023-11-29 00:36:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3032 transitions. [2023-11-29 00:36:47,481 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3032 transitions. Word has length 271 [2023-11-29 00:36:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:47,481 INFO L495 AbstractCegarLoop]: Abstraction has 2722 states and 3032 transitions. [2023-11-29 00:36:47,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 00:36:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3032 transitions. [2023-11-29 00:36:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2023-11-29 00:36:47,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:47,484 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 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] [2023-11-29 00:36:47,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 00:36:47,484 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:47,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1835385845, now seen corresponding path program 1 times [2023-11-29 00:36:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323490653] [2023-11-29 00:36:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:36:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 00:36:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 00:36:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:36:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 00:36:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:36:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:36:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 00:36:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 00:36:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 00:36:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 00:36:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 00:36:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 00:36:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 00:36:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-29 00:36:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 00:36:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-29 00:36:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2023-11-29 00:36:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323490653] [2023-11-29 00:36:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323490653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874303088] [2023-11-29 00:36:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:36:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:36:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:47,635 INFO L87 Difference]: Start difference. First operand 2722 states and 3032 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-29 00:36:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:48,068 INFO L93 Difference]: Finished difference Result 3972 states and 4429 transitions. [2023-11-29 00:36:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:36:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 280 [2023-11-29 00:36:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:48,073 INFO L225 Difference]: With dead ends: 3972 [2023-11-29 00:36:48,073 INFO L226 Difference]: Without dead ends: 3971 [2023-11-29 00:36:48,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:48,074 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 146 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:48,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 422 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2023-11-29 00:36:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 2700. [2023-11-29 00:36:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2236 states have (on average 1.0961538461538463) internal successors, (2451), 2250 states have internal predecessors, (2451), 262 states have call successors, (262), 189 states have call predecessors, (262), 200 states have return successors, (295), 260 states have call predecessors, (295), 262 states have call successors, (295) [2023-11-29 00:36:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3008 transitions. [2023-11-29 00:36:48,242 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3008 transitions. Word has length 280 [2023-11-29 00:36:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:48,242 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3008 transitions. [2023-11-29 00:36:48,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-29 00:36:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3008 transitions. [2023-11-29 00:36:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2023-11-29 00:36:48,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:48,247 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:48,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 00:36:48,247 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:48,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1965737938, now seen corresponding path program 1 times [2023-11-29 00:36:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:48,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665191139] [2023-11-29 00:36:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:48,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:36:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 00:36:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:36:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 00:36:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 00:36:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 00:36:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-29 00:36:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 00:36:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 00:36:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-29 00:36:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-29 00:36:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 00:36:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-29 00:36:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 00:36:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-29 00:36:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 00:36:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 00:36:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-11-29 00:36:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2023-11-29 00:36:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-11-29 00:36:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-11-29 00:36:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-11-29 00:36:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2023-11-29 00:36:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2023-11-29 00:36:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-11-29 00:36:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-11-29 00:36:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2023-11-29 00:36:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2023-11-29 00:36:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2023-11-29 00:36:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2023-11-29 00:36:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 143 proven. 80 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2023-11-29 00:36:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665191139] [2023-11-29 00:36:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665191139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541313083] [2023-11-29 00:36:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:48,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:48,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:48,363 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:48,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 00:36:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:48,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:48,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2023-11-29 00:36:48,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541313083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-29 00:36:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154015371] [2023-11-29 00:36:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:48,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:48,609 INFO L87 Difference]: Start difference. First operand 2700 states and 3008 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2023-11-29 00:36:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:48,731 INFO L93 Difference]: Finished difference Result 4244 states and 4754 transitions. [2023-11-29 00:36:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 452 [2023-11-29 00:36:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:48,734 INFO L225 Difference]: With dead ends: 4244 [2023-11-29 00:36:48,734 INFO L226 Difference]: Without dead ends: 1871 [2023-11-29 00:36:48,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:48,737 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:48,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 172 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-11-29 00:36:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2023-11-29 00:36:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1573 states have (on average 1.0832803560076287) internal successors, (1704), 1580 states have internal predecessors, (1704), 166 states have call successors, (166), 119 states have call predecessors, (166), 130 states have return successors, (177), 171 states have call predecessors, (177), 166 states have call successors, (177) [2023-11-29 00:36:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2047 transitions. [2023-11-29 00:36:48,842 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2047 transitions. Word has length 452 [2023-11-29 00:36:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:48,842 INFO L495 AbstractCegarLoop]: Abstraction has 1871 states and 2047 transitions. [2023-11-29 00:36:48,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2023-11-29 00:36:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2047 transitions. [2023-11-29 00:36:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-11-29 00:36:48,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:48,845 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 14, 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, 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, 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] [2023-11-29 00:36:48,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:49,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 00:36:49,046 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:49,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 536078613, now seen corresponding path program 1 times [2023-11-29 00:36:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075253274] [2023-11-29 00:36:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:36:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:36:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 00:36:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 00:36:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:36:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 00:36:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:36:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 00:36:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 00:36:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-29 00:36:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:36:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 00:36:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 00:36:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 00:36:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 00:36:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-29 00:36:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 00:36:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-11-29 00:36:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2023-11-29 00:36:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-11-29 00:36:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-11-29 00:36:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-11-29 00:36:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 00:36:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 00:36:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-29 00:36:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-11-29 00:36:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2023-11-29 00:36:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2023-11-29 00:36:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-11-29 00:36:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2023-11-29 00:36:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2023-11-29 00:36:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2023-11-29 00:36:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2023-11-29 00:36:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2023-11-29 00:36:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2023-11-29 00:36:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 163 proven. 60 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2023-11-29 00:36:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075253274] [2023-11-29 00:36:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075253274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734818154] [2023-11-29 00:36:49,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:49,202 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 00:36:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:36:49,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2023-11-29 00:36:49,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734818154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:49,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-29 00:36:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94551270] [2023-11-29 00:36:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:49,462 INFO L87 Difference]: Start difference. First operand 1871 states and 2047 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:36:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:49,558 INFO L93 Difference]: Finished difference Result 2305 states and 2520 transitions. [2023-11-29 00:36:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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 455 [2023-11-29 00:36:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:49,559 INFO L225 Difference]: With dead ends: 2305 [2023-11-29 00:36:49,559 INFO L226 Difference]: Without dead ends: 591 [2023-11-29 00:36:49,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:49,561 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 124 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:49,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 228 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2023-11-29 00:36:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2023-11-29 00:36:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 497 states have (on average 1.0704225352112675) internal successors, (532), 498 states have internal predecessors, (532), 52 states have call successors, (52), 39 states have call predecessors, (52), 40 states have return successors, (53), 53 states have call predecessors, (53), 52 states have call successors, (53) [2023-11-29 00:36:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 637 transitions. [2023-11-29 00:36:49,595 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 637 transitions. Word has length 455 [2023-11-29 00:36:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:49,596 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 637 transitions. [2023-11-29 00:36:49,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:36:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 637 transitions. [2023-11-29 00:36:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-11-29 00:36:49,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:49,598 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 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, 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] [2023-11-29 00:36:49,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:49,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 00:36:49,799 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:36:49,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -125076692, now seen corresponding path program 1 times [2023-11-29 00:36:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736025475] [2023-11-29 00:36:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:36:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:36:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:36:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:36:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 00:36:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:36:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:36:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:36:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:36:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 00:36:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 00:36:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 00:36:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 00:36:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 00:36:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 00:36:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 00:36:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:36:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 00:36:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-29 00:36:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-11-29 00:36:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2023-11-29 00:36:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-11-29 00:36:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 00:36:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2023-11-29 00:36:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-11-29 00:36:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-11-29 00:36:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-11-29 00:36:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2023-11-29 00:36:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-11-29 00:36:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2023-11-29 00:36:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2023-11-29 00:36:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2023-11-29 00:36:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2023-11-29 00:36:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2023-11-29 00:36:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2023-11-29 00:36:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2023-11-29 00:36:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1555 trivial. 0 not checked. [2023-11-29 00:36:49,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736025475] [2023-11-29 00:36:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736025475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931029610] [2023-11-29 00:36:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:49,996 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:49,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 00:36:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:50,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:36:50,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-11-29 00:36:50,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931029610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:50,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2023-11-29 00:36:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465487426] [2023-11-29 00:36:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:50,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:50,904 INFO L87 Difference]: Start difference. First operand 591 states and 637 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 4 states have internal predecessors, (243), 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) [2023-11-29 00:36:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:51,021 INFO L93 Difference]: Finished difference Result 591 states and 637 transitions. [2023-11-29 00:36:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:51,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 4 states have internal predecessors, (243), 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 473 [2023-11-29 00:36:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:51,022 INFO L225 Difference]: With dead ends: 591 [2023-11-29 00:36:51,022 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:36:51,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:51,023 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:51,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 360 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:36:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:36:51,025 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) [2023-11-29 00:36:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:36:51,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 473 [2023-11-29 00:36:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:51,025 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:36:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 4 states have internal predecessors, (243), 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) [2023-11-29 00:36:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:36:51,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:36:51,028 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-29 00:36:51,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-29 00:36:51,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 00:36:51,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 00:36:51,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:37:17,559 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2023-11-29 00:37:17,559 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2023-11-29 00:37:17,560 INFO L899 garLoopResultBuilder]: For program point L128(lines 116 130) no Hoare annotation was computed. [2023-11-29 00:37:17,561 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 374 399) the Hoare annotation is: (let ((.cse9 (< 0 ~P_1_ev~0)) (.cse11 (< 0 ~C_1_ev~0)) (.cse0 (< ~i~0 0)) (.cse8 (not (= ~C_1_i~0 1))) (.cse16 (not (= 2 ~C_1_pc~0))) (.cse17 (< 1 ~i~0)) (.cse4 (= |old(~P_1_st~0)| 0)) (.cse29 (< ~C_1_ev~0 2)) (.cse24 (< ~P_1_ev~0 2)) (.cse12 (< 0 ~e~0)) (.cse5 (= |old(~C_1_st~0)| 0)) (.cse6 (not (= ~num~0 0))) (.cse7 (< ~P_1_pc~0 1))) (let ((.cse28 (and (or .cse0 .cse8 .cse16 .cse17 .cse9 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse16 .cse17 .cse4 .cse29 .cse24 .cse12 .cse5 .cse6 .cse7))) (.cse20 (< 2147483646 ~i~0)) (.cse26 (< ~i~0 1)) (.cse27 (< 2 ~max_loop~0)) (.cse15 (< 1 ~C_1_pc~0)) (.cse18 (not (= ~num~0 1))) (.cse19 (< ~i~0 ~max_loop~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (not (= ~C_1_pc~0 0))) (.cse10 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse13 (not (= ~P_1_pc~0 0))) (.cse14 (< 0 ~i~0)) (.cse25 (not (= ~P_1_ev~0 1))) (.cse1 (and (= ~C_1_st~0 |old(~C_1_st~0)|) (= |old(~P_1_st~0)| ~P_1_st~0))) (.cse22 (< ~num~0 1)) (.cse23 (not (= ~C_1_pc~0 1))) (.cse21 (not (= ~C_1_ev~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not .cse4) .cse0 .cse8 (and (= ~C_1_st~0 0) (= ~P_1_st~0 0)) .cse9 .cse10 .cse11 (not (= ~max_loop~0 2)) .cse12 .cse13 .cse6 .cse14 (not .cse5)) (or .cse0 .cse1 .cse15 .cse4 .cse12 .cse13 .cse5 .cse6) (or .cse0 .cse8 .cse1 .cse16 .cse17 .cse9 .cse4 .cse11 .cse12 .cse5 .cse7 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse16 .cse4 .cse21 .cse12 .cse6 .cse7) (or .cse8 .cse1 .cse22 .cse23 (and (or .cse0 .cse4 .cse24 .cse12 .cse5 .cse7) (or .cse0 .cse17 .cse9 .cse4 .cse11 (< 1 ~num~0) .cse12 .cse5 .cse7))) (or .cse0 .cse25 .cse8 .cse1 .cse16 .cse4 .cse21 .cse12 .cse5 .cse6 .cse7 .cse19) (or .cse1 .cse26 .cse27 .cse28) (or .cse1 .cse28 .cse19) (or .cse0 .cse8 .cse1 .cse16 .cse4 .cse29 .cse24 .cse12 .cse5 .cse6 .cse7 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse16 .cse4 .cse12 .cse5 .cse6 .cse7) (or .cse0 .cse25 .cse8 .cse1 .cse23 .cse4 .cse21 .cse12 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse22 .cse15 .cse4 .cse12 .cse5 .cse7) (or .cse25 .cse8 .cse1 .cse16 .cse4 .cse21 .cse26 .cse12 .cse27 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse16 .cse4 .cse29 .cse24 .cse12 .cse5 .cse7 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse12 .cse5 .cse6 .cse7) (or .cse0 .cse25 .cse8 .cse1 .cse16 .cse4 .cse21 .cse12 .cse5 .cse7 .cse18 .cse19) (or .cse0 .cse8 .cse1 .cse23 .cse4 .cse24 .cse12 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse4 .cse10 .cse12 .cse13 .cse6 .cse14) (or .cse0 .cse25 .cse8 .cse1 .cse22 .cse23 .cse4 .cse21 .cse12 .cse5 .cse7)))) [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L220(lines 198 222) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L899 garLoopResultBuilder]: For program point L267(lines 251 269) no Hoare annotation was computed. [2023-11-29 00:37:17,562 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 250 269) the Hoare annotation is: true [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-11-29 00:37:17,563 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2023-11-29 00:37:17,564 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2023-11-29 00:37:17,564 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 430 488) no Hoare annotation was computed. [2023-11-29 00:37:17,564 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2023-11-29 00:37:17,564 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse3 (= ~C_1_st~0 0))) (let ((.cse16 (<= 1 ~num~0)) (.cse17 (<= 2 ~P_1_pc~0)) (.cse14 (<= ~C_1_pc~0 1)) (.cse23 (= ~C_1_pc~0 1)) (.cse25 (= ~P_1_pc~0 0)) (.cse24 (= ~C_1_pc~0 0)) (.cse21 (<= ~i~0 1)) (.cse18 (<= ~max_loop~0 ~i~0)) (.cse19 (= ~num~0 1)) (.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse22 (<= ~C_1_ev~0 0)) (.cse7 (= ~i~0 1)) (.cse15 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse6 (<= ~max_loop~0 2)) (.cse2 (= 2 ~C_1_pc~0)) (.cse5 (<= ~e~0 0)) (.cse10 (<= 0 ~i~0)) (.cse11 (<= ~i~0 2147483646)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse8 (= ~num~0 0)) (.cse4 (= ~P_1_pc~0 1)) (.cse13 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse14 .cse5 .cse10 .cse15 .cse16 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse18 .cse12 .cse19 .cse9) (and .cse2 .cse5 .cse10 .cse20 .cse21 .cse22 .cse18 .cse12 .cse8 .cse15 .cse9 .cse13) (and .cse14 .cse5 .cse10 .cse8 .cse15 .cse17 .cse13) (and .cse1 .cse23 .cse5 .cse10 .cse12 .cse15 (<= 0 ~num~0) .cse9) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse18 .cse12 .cse19 .cse9 .cse13) (and .cse10 .cse24 .cse8 .cse15 .cse17 .cse13) (and .cse10 .cse24 .cse15 .cse16 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse18 .cse12 .cse8 .cse9 .cse13) (and .cse14 .cse5 .cse10 .cse25 .cse8 .cse15 .cse13) (and .cse10 .cse25 .cse24 .cse8 .cse15 .cse13) (and .cse23 .cse5 .cse10 .cse20 .cse21 .cse22 .cse12 .cse19 .cse15 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse18 .cse12 .cse8 .cse9) (and (= ~i~0 0) .cse5 .cse25 .cse24 .cse8 .cse13) (and .cse2 .cse5 .cse10 .cse20 .cse21 .cse22 .cse18 .cse12 .cse19 .cse15 .cse9 .cse13) (and .cse4 (or (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse13) (and .cse2 .cse5 .cse20 .cse22 .cse7 .cse8 .cse15 .cse9 .cse13)) .cse6) (and .cse2 .cse5 .cse10 .cse11 .cse12 .cse8 (not .cse4) .cse13)))) [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2023-11-29 00:37:17,565 INFO L899 garLoopResultBuilder]: For program point P_1_returnLabel#1(lines 78 112) no Hoare annotation was computed. [2023-11-29 00:37:17,566 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse2 (= ~P_1_ev~0 1)) (.cse15 (<= ~max_loop~0 ~i~0)) (.cse8 (= ~C_1_i~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse13 (= 2 ~C_1_pc~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse14 (= ~P_1_pc~0 1)) (.cse7 (= ~C_1_ev~0 1)) (.cse10 (<= ~C_1_pc~0 1)) (.cse3 (<= 0 ~i~0)) (.cse6 (not (= ~C_1_st~0 0))) (.cse1 (<= ~e~0 0)) (.cse17 (= ~P_1_pc~0 0)) (.cse16 (= ~C_1_pc~0 0)) (.cse5 (= ~num~0 0)) (.cse9 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse6 .cse11 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9) (and .cse13 .cse14 .cse1 .cse2 (<= ~max_loop~0 2) (= ~i~0 1) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse15 .cse4 (= ~num~0 1) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse5 .cse6 .cse12 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse3 .cse16 .cse5 .cse6 .cse12 .cse9) (and .cse3 .cse16 .cse6 .cse11 .cse12 .cse9) (and .cse13 .cse1 .cse3 (<= ~i~0 2147483646) .cse4 .cse5 (not .cse14) .cse7 .cse9) (and .cse10 .cse1 .cse3 .cse17 .cse5 .cse6 .cse9) (and .cse3 .cse17 .cse16 .cse5 .cse6 .cse9) (and (= ~i~0 0) .cse1 .cse17 .cse16 .cse5 .cse9))) [2023-11-29 00:37:17,566 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2023-11-29 00:37:17,566 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2023-11-29 00:37:17,566 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2023-11-29 00:37:17,567 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse24 (= ~P_1_st~0 0)) (.cse3 (= ~C_1_st~0 0))) (let ((.cse22 (<= 1 ~num~0)) (.cse23 (<= 2 ~P_1_pc~0)) (.cse20 (<= ~C_1_pc~0 1)) (.cse29 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse27 (= ~C_1_pc~0 1)) (.cse16 (= ~max_loop~0 2)) (.cse14 (= ~i~0 0)) (.cse18 (= ~P_1_pc~0 0)) (.cse19 (= ~C_1_pc~0 0)) (.cse26 (<= ~i~0 1)) (.cse25 (<= ~max_loop~0 ~i~0)) (.cse28 (= ~num~0 1)) (.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse15 (<= ~P_1_ev~0 0)) (.cse17 (<= ~C_1_ev~0 0)) (.cse7 (= ~i~0 1)) (.cse21 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse6 (<= ~max_loop~0 2)) (.cse2 (= 2 ~C_1_pc~0)) (.cse5 (<= ~e~0 0)) (.cse10 (<= 0 ~i~0)) (.cse11 (<= ~i~0 2147483646)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse8 (= ~num~0 0)) (.cse4 (= ~P_1_pc~0 1)) (.cse13 (not .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse3 .cse14 .cse5 .cse15 .cse16 .cse17 .cse18 .cse19 .cse8 .cse9) (and .cse20 .cse5 .cse10 .cse21 .cse22 .cse23 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse24 .cse25 .cse12 .cse8 .cse9) (and .cse2 .cse5 .cse10 .cse15 .cse26 .cse17 .cse25 .cse12 .cse8 .cse21 .cse9 .cse13) (and .cse20 .cse5 .cse10 .cse8 .cse21 .cse23 .cse13) (and .cse1 .cse27 .cse5 .cse10 .cse12 .cse21 (<= 0 ~num~0) .cse9) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse25 .cse12 .cse28 .cse9 .cse13) (and .cse10 .cse19 .cse8 .cse21 .cse23 .cse13) (and .cse10 .cse19 .cse21 .cse22 .cse23 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse25 .cse12 .cse8 .cse9 .cse13) (and .cse20 .cse5 .cse10 .cse18 .cse8 .cse21 .cse13) (and .cse3 .cse4 .cse14 .cse5 .cse29 .cse15 .cse16 .cse17 .cse19 .cse28 .cse9 .cse13) (and .cse10 .cse18 .cse19 .cse8 .cse21 .cse13) (and .cse27 .cse5 .cse10 .cse29 .cse15 .cse26 .cse17 .cse18 .cse8 .cse21 .cse9) (and .cse27 .cse5 .cse10 .cse15 .cse26 .cse17 .cse12 .cse28 .cse21 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse28 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse24 .cse25 .cse12 .cse28 .cse9) (and .cse14 .cse5 .cse18 .cse19 .cse8 .cse13) (and .cse2 .cse5 .cse10 .cse15 .cse26 .cse17 .cse25 .cse12 .cse28 .cse21 .cse9 .cse13) (and .cse4 (or (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse13) (and .cse2 .cse5 .cse15 .cse17 .cse7 .cse8 .cse21 .cse9 .cse13)) .cse6) (and .cse2 .cse5 .cse10 .cse11 .cse12 .cse8 (not .cse4) .cse13)))) [2023-11-29 00:37:17,567 INFO L899 garLoopResultBuilder]: For program point C_1_returnLabel#1(lines 137 194) no Hoare annotation was computed. [2023-11-29 00:37:17,567 INFO L895 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-29 00:37:17,567 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse12 (<= 1 ~num~0)) (.cse13 (<= 2 ~P_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse11 (<= ~C_1_pc~0 1)) (.cse19 (= ~C_1_pc~0 1)) (.cse22 (= ~P_1_pc~0 0)) (.cse21 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= ~max_loop~0 ~i~0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse7 (= ~num~0 1)) (.cse8 (not (= ~C_1_st~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 .cse11 .cse3 .cse4 .cse8 .cse12 .cse13 .cse10) (and (let ((.cse14 (= ~i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse14 .cse15 .cse8 .cse9 .cse10))) .cse18 (<= ~max_loop~0 2)) (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse4 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse8 .cse12 .cse13 .cse10) (and .cse2 .cse3 .cse4 (<= ~i~0 2147483646) .cse6 .cse15 (not .cse18) .cse8 .cse10) (and .cse11 .cse3 .cse4 .cse22 .cse15 .cse8 .cse10) (and .cse4 .cse22 .cse21 .cse15 .cse8 .cse10) (and .cse19 .cse3 .cse4 .cse16 .cse20 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~i~0 0) .cse3 .cse22 .cse21 .cse15 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 00:37:17,567 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2023-11-29 00:37:17,568 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)) [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2023-11-29 00:37:17,568 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2023-11-29 00:37:17,569 INFO L895 garLoopResultBuilder]: At program point $Ultimate##55(lines 156 186) the Hoare annotation is: (let ((.cse10 (<= ~i~0 2147483646)) (.cse12 (= ~P_1_pc~0 1)) (.cse6 (not (= ~P_1_st~0 0))) (.cse19 (= ~num~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse7 (= 2 ~C_1_pc~0)) (.cse8 (<= 0 ~i~0)) (.cse20 (<= ~max_loop~0 ~i~0)) (.cse11 (<= 1 ~P_1_pc~0)) (.cse0 (= ~i~0 0)) (.cse1 (<= ~e~0 0)) (.cse9 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse16 (<= ~P_1_ev~0 0)) (.cse17 (= ~max_loop~0 2)) (.cse18 (<= ~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))) (.cse15 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse4 (not .cse12) .cse5 .cse6) (and .cse13 .cse14 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse4 .cse5 .cse15) (and .cse12 .cse0 .cse1 .cse9 .cse16 .cse17 .cse18 .cse3 .cse19 .cse5 .cse15 .cse6) (and .cse13 .cse14 .cse7 .cse12 .cse1 .cse9 (<= ~max_loop~0 2) (= ~i~0 1) .cse19 .cse5 .cse15 .cse6) (and .cse13 .cse14 .cse7 .cse1 .cse8 .cse9 .cse20 .cse11 .cse19 .cse5 .cse15) (and .cse13 .cse14 .cse7 .cse1 .cse8 .cse9 .cse20 .cse11 .cse4 .cse5 .cse15) (and .cse0 .cse1 .cse9 .cse16 .cse17 .cse18 .cse2 .cse3 .cse4 .cse5 .cse15))) [2023-11-29 00:37:17,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2023-11-29 00:37:17,569 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 168) no Hoare annotation was computed. [2023-11-29 00:37:17,569 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-11-29 00:37:17,569 INFO L899 garLoopResultBuilder]: For program point L241-1(lines 232 249) no Hoare annotation was computed. [2023-11-29 00:37:17,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2023-11-29 00:37:17,569 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))) [2023-11-29 00:37:17,569 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))) [2023-11-29 00:37:17,570 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2023-11-29 00:37:17,570 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 93 104) the Hoare annotation is: (let ((.cse17 (= ~C_1_st~0 0))) (let ((.cse11 (= ~C_1_pc~0 1)) (.cse15 (not .cse17)) (.cse12 (<= ~P_1_ev~0 0)) (.cse13 (<= ~C_1_ev~0 0)) (.cse14 (= ~P_1_pc~0 0)) (.cse8 (= ~num~0 0)) (.cse16 (<= 1 ~num~0)) (.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse6 (<= ~max_loop~0 ~i~0)) (.cse7 (<= 1 ~P_1_pc~0)) (.cse18 (= ~num~0 1)) (.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 .cse11 (or (and .cse3 .cse4 .cse5 .cse12 (<= ~i~0 1) .cse13 .cse14 .cse8 .cse15 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse14 .cse8 .cse15 .cse10)) .cse9) (and .cse1 .cse11 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse9 .cse10) (and .cse1 .cse11 .cse3 .cse4 .cse5 .cse7 .cse15 .cse16 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse17 (= ~P_1_pc~0 1) .cse3 .cse5 (<= ~max_loop~0 2) (= ~i~0 1) .cse8 .cse9 .cse10) (and .cse17 (= ~i~0 0) .cse3 .cse5 .cse12 (= ~max_loop~0 2) .cse13 .cse14 (= ~C_1_pc~0 0) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 (<= ~num~0 2) (<= (+ ~i~0 1) ~max_loop~0) .cse7 .cse16 (not .cse18) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10)))) [2023-11-29 00:37:17,571 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse12 (<= 1 ~num~0)) (.cse13 (<= 2 ~P_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse11 (<= ~C_1_pc~0 1)) (.cse19 (= ~C_1_pc~0 1)) (.cse22 (= ~P_1_pc~0 0)) (.cse21 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= ~max_loop~0 ~i~0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse7 (= ~num~0 1)) (.cse8 (not (= ~C_1_st~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 .cse11 .cse3 .cse4 .cse8 .cse12 .cse13 .cse10) (and (let ((.cse14 (= ~i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse14 .cse15 .cse8 .cse9 .cse10))) .cse18 (<= ~max_loop~0 2)) (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse4 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse8 .cse12 .cse13 .cse10) (and .cse2 .cse3 .cse4 (<= ~i~0 2147483646) .cse6 .cse15 (not .cse18) .cse8 .cse10) (and .cse11 .cse3 .cse4 .cse22 .cse15 .cse8 .cse10) (and .cse4 .cse22 .cse21 .cse15 .cse8 .cse10) (and .cse19 .cse3 .cse4 .cse16 .cse20 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~i~0 0) .cse3 .cse22 .cse21 .cse15 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 00:37:17,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2023-11-29 00:37:17,571 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse12 (<= 1 ~num~0)) (.cse13 (<= 2 ~P_1_pc~0)) (.cse18 (= ~P_1_pc~0 1)) (.cse11 (<= ~C_1_pc~0 1)) (.cse19 (= ~C_1_pc~0 1)) (.cse22 (= ~P_1_pc~0 0)) (.cse21 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= ~max_loop~0 ~i~0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse7 (= ~num~0 1)) (.cse8 (not (= ~C_1_st~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 .cse11 .cse3 .cse4 .cse8 .cse12 .cse13 .cse10) (and (let ((.cse14 (= ~i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse14 .cse15 .cse8 .cse9 .cse10))) .cse18 (<= ~max_loop~0 2)) (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse4 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse8 .cse12 .cse13 .cse10) (and .cse2 .cse3 .cse4 (<= ~i~0 2147483646) .cse6 .cse15 (not .cse18) .cse8 .cse10) (and .cse11 .cse3 .cse4 .cse22 .cse15 .cse8 .cse10) (and .cse4 .cse22 .cse21 .cse15 .cse8 .cse10) (and .cse19 .cse3 .cse4 .cse16 .cse20 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~i~0 0) .cse3 .cse22 .cse21 .cse15 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 00:37:17,571 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2023-11-29 00:37:17,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2023-11-29 00:37:17,571 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2023-11-29 00:37:17,572 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))) [2023-11-29 00:37:17,572 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2023-11-29 00:37:17,572 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse18 (= ~P_1_pc~0 1))) (let ((.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse12 (<= 1 ~num~0)) (.cse13 (<= 2 ~P_1_pc~0)) (.cse22 (<= ~i~0 2147483646)) (.cse23 (not .cse18)) (.cse11 (<= ~C_1_pc~0 1)) (.cse19 (= ~C_1_pc~0 1)) (.cse24 (= ~P_1_pc~0 0)) (.cse21 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= ~max_loop~0 ~i~0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse7 (= ~num~0 1)) (.cse8 (not (= ~C_1_st~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 .cse11 .cse3 .cse4 .cse8 .cse12 .cse13 .cse10) (and (let ((.cse14 (= ~i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse14 .cse15 .cse8 .cse9 .cse10))) .cse18 (<= ~max_loop~0 2)) (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse4 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse8 .cse12 .cse13 .cse10) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse15 .cse23 .cse8 .cse10) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse15 .cse23 (= ~C_1_ev~0 1) .cse10) (and .cse11 .cse3 .cse4 .cse24 .cse15 .cse8 .cse10) (and .cse4 .cse24 .cse21 .cse15 .cse8 .cse10) (and .cse19 .cse3 .cse4 .cse16 .cse20 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~i~0 0) .cse3 .cse24 .cse21 .cse15 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-11-29 00:37:17,572 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2023-11-29 00:37:17,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2023-11-29 00:37:17,573 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2023-11-29 00:37:17,573 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-29 00:37:17,573 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-11-29 00:37:17,573 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse18 (= ~P_1_pc~0 1))) (let ((.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse12 (<= 1 ~num~0)) (.cse13 (<= 2 ~P_1_pc~0)) (.cse22 (<= ~i~0 2147483646)) (.cse23 (not .cse18)) (.cse11 (<= ~C_1_pc~0 1)) (.cse19 (= ~C_1_pc~0 1)) (.cse24 (= ~P_1_pc~0 0)) (.cse21 (= ~C_1_pc~0 0)) (.cse15 (= ~num~0 0)) (.cse2 (= 2 ~C_1_pc~0)) (.cse3 (<= ~e~0 0)) (.cse4 (<= 0 ~i~0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse20 (<= ~i~0 1)) (.cse17 (<= ~C_1_ev~0 0)) (.cse5 (<= ~max_loop~0 ~i~0)) (.cse6 (<= 1 ~P_1_pc~0)) (.cse7 (= ~num~0 1)) (.cse8 (not (= ~C_1_st~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 .cse11 .cse3 .cse4 .cse8 .cse12 .cse13 .cse10) (and (let ((.cse14 (= ~i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse14 .cse15 .cse8 .cse9 .cse10))) .cse18 (<= ~max_loop~0 2)) (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse8 (<= 0 ~num~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse15 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse4 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse15 .cse8 .cse13 .cse10) (and .cse4 .cse21 .cse8 .cse12 .cse13 .cse10) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse15 .cse23 .cse8 .cse10) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse15 .cse23 (= ~C_1_ev~0 1) .cse10) (and .cse11 .cse3 .cse4 .cse24 .cse15 .cse8 .cse10) (and .cse4 .cse24 .cse21 .cse15 .cse8 .cse10) (and .cse19 .cse3 .cse4 .cse16 .cse20 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~i~0 0) .cse3 .cse24 .cse21 .cse15 .cse10) (and .cse2 .cse3 .cse4 .cse16 .cse20 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-11-29 00:37:17,573 INFO L899 garLoopResultBuilder]: For program point L426(lines 415 428) no Hoare annotation was computed. [2023-11-29 00:37:17,573 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 271 325) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2023-11-29 00:37:17,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2023-11-29 00:37:17,575 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 445 482) the Hoare annotation is: (let ((.cse3 (= ~C_1_st~0 0))) (let ((.cse21 (<= 1 ~num~0)) (.cse22 (<= 2 ~P_1_pc~0)) (.cse19 (<= ~C_1_pc~0 1)) (.cse26 (= ~C_1_pc~0 1)) (.cse14 (= ~i~0 0)) (.cse17 (= ~P_1_pc~0 0)) (.cse18 (= ~C_1_pc~0 0)) (.cse25 (<= ~i~0 1)) (.cse23 (<= ~max_loop~0 ~i~0)) (.cse24 (= ~num~0 1)) (.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse15 (<= ~P_1_ev~0 0)) (.cse16 (<= ~C_1_ev~0 0)) (.cse7 (= ~i~0 1)) (.cse20 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse6 (<= ~max_loop~0 2)) (.cse2 (= 2 ~C_1_pc~0)) (.cse5 (<= ~e~0 0)) (.cse10 (<= 0 ~i~0)) (.cse11 (<= ~i~0 2147483646)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse8 (= ~num~0 0)) (.cse4 (= ~P_1_pc~0 1)) (.cse13 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse3 .cse14 .cse5 .cse15 (= ~max_loop~0 2) .cse16 .cse17 .cse18 .cse8 .cse9) (and .cse19 .cse5 .cse10 .cse20 .cse21 .cse22 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse23 .cse12 .cse24 .cse9) (and .cse2 .cse5 .cse10 .cse15 .cse25 .cse16 .cse23 .cse12 .cse8 .cse20 .cse9 .cse13) (and .cse19 .cse5 .cse10 .cse8 .cse20 .cse22 .cse13) (and .cse1 .cse26 .cse5 .cse10 .cse12 .cse20 (<= 0 ~num~0) .cse9) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse23 .cse12 .cse24 .cse9 .cse13) (and .cse10 .cse18 .cse8 .cse20 .cse22 .cse13) (and .cse10 .cse18 .cse20 .cse21 .cse22 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse23 .cse12 .cse8 .cse9 .cse13) (and .cse19 .cse5 .cse10 .cse17 .cse8 .cse20 .cse13) (and .cse10 .cse17 .cse18 .cse8 .cse20 .cse13) (and .cse26 .cse5 .cse10 .cse15 .cse25 .cse16 .cse12 .cse24 .cse20 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse23 .cse12 .cse8 .cse9) (and .cse14 .cse5 .cse17 .cse18 .cse8 .cse13) (and .cse2 .cse5 .cse10 .cse15 .cse25 .cse16 .cse23 .cse12 .cse24 .cse20 .cse9 .cse13) (and .cse4 (or (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse13) (and .cse2 .cse5 .cse15 .cse16 .cse7 .cse8 .cse20 .cse9 .cse13)) .cse6) (and .cse2 .cse5 .cse10 .cse11 .cse12 .cse8 (not .cse4) .cse13)))) [2023-11-29 00:37:17,576 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse24 (= ~P_1_st~0 0)) (.cse3 (= ~C_1_st~0 0))) (let ((.cse22 (<= 1 ~num~0)) (.cse23 (<= 2 ~P_1_pc~0)) (.cse20 (<= ~C_1_pc~0 1)) (.cse29 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse27 (= ~C_1_pc~0 1)) (.cse16 (= ~max_loop~0 2)) (.cse14 (= ~i~0 0)) (.cse18 (= ~P_1_pc~0 0)) (.cse19 (= ~C_1_pc~0 0)) (.cse26 (<= ~i~0 1)) (.cse25 (<= ~max_loop~0 ~i~0)) (.cse28 (= ~num~0 1)) (.cse0 (<= 2 ~C_1_ev~0)) (.cse1 (<= 2 ~P_1_ev~0)) (.cse15 (<= ~P_1_ev~0 0)) (.cse17 (<= ~C_1_ev~0 0)) (.cse7 (= ~i~0 1)) (.cse21 (not .cse3)) (.cse9 (= ~C_1_i~0 1)) (.cse6 (<= ~max_loop~0 2)) (.cse2 (= 2 ~C_1_pc~0)) (.cse5 (<= ~e~0 0)) (.cse10 (<= 0 ~i~0)) (.cse11 (<= ~i~0 2147483646)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse8 (= ~num~0 0)) (.cse4 (= ~P_1_pc~0 1)) (.cse13 (not .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse3 .cse14 .cse5 .cse15 .cse16 .cse17 .cse18 .cse19 .cse8 .cse9) (and .cse20 .cse5 .cse10 .cse21 .cse22 .cse23 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse24 .cse25 .cse12 .cse8 .cse9) (and .cse2 .cse5 .cse10 .cse15 .cse26 .cse17 .cse25 .cse12 .cse8 .cse21 .cse9 .cse13) (and .cse20 .cse5 .cse10 .cse8 .cse21 .cse23 .cse13) (and .cse1 .cse27 .cse5 .cse10 .cse12 .cse21 (<= 0 ~num~0) .cse9) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse25 .cse12 .cse28 .cse9 .cse13) (and .cse10 .cse19 .cse8 .cse21 .cse23 .cse13) (and .cse10 .cse19 .cse21 .cse22 .cse23 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse25 .cse12 .cse8 .cse9 .cse13) (and .cse20 .cse5 .cse10 .cse18 .cse8 .cse21 .cse13) (and .cse3 .cse4 .cse14 .cse5 .cse29 .cse15 .cse16 .cse17 .cse19 .cse28 .cse9 .cse13) (and .cse10 .cse18 .cse19 .cse8 .cse21 .cse13) (and .cse27 .cse5 .cse10 .cse29 .cse15 .cse26 .cse17 .cse18 .cse8 .cse21 .cse9) (and .cse27 .cse5 .cse10 .cse15 .cse26 .cse17 .cse12 .cse28 .cse21 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse28 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse24 .cse25 .cse12 .cse28 .cse9) (and .cse14 .cse5 .cse18 .cse19 .cse8 .cse13) (and .cse2 .cse5 .cse10 .cse15 .cse26 .cse17 .cse25 .cse12 .cse28 .cse21 .cse9 .cse13) (and .cse4 (or (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse9 .cse13) (and .cse2 .cse5 .cse15 .cse17 .cse7 .cse8 .cse21 .cse9 .cse13)) .cse6) (and .cse2 .cse5 .cse10 .cse11 .cse12 .cse8 (not .cse4) .cse13)))) [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 55 73) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L51(lines 36 53) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2023-11-29 00:37:17,576 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2023-11-29 00:37:17,577 INFO L899 garLoopResultBuilder]: For program point L365-1(lines 356 373) no Hoare annotation was computed. [2023-11-29 00:37:17,577 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-11-29 00:37:17,577 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-11-29 00:37:17,579 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, 1, 1, 1] [2023-11-29 00:37:17,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:37:17,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 [2023-11-29 00:37:17,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:37:17 BoogieIcfgContainer [2023-11-29 00:37:17,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:37:17,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:37:17,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:37:17,620 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:37:17,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:07" (3/4) ... [2023-11-29 00:37:17,622 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:37:17,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-29 00:37:17,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-29 00:37:17,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-29 00:37:17,627 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-29 00:37:17,627 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-29 00:37:17,627 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-29 00:37:17,636 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-29 00:37:17,637 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 00:37:17,638 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:37:17,638 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:37:17,778 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:37:17,778 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:37:17,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:37:17,779 INFO L158 Benchmark]: Toolchain (without parser) took 71484.73ms. Allocated memory was 136.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 91.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 542.1MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,779 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 136.3MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:37:17,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.21ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 78.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.63ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 76.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,780 INFO L158 Benchmark]: Boogie Preprocessor took 50.77ms. Allocated memory is still 136.3MB. Free memory was 76.0MB in the beginning and 73.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,780 INFO L158 Benchmark]: RCFGBuilder took 512.99ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 73.5MB in the beginning and 151.2MB in the end (delta: -77.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,781 INFO L158 Benchmark]: TraceAbstraction took 70383.45ms. Allocated memory was 186.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 150.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-29 00:37:17,781 INFO L158 Benchmark]: Witness Printer took 158.61ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 00:37:17,782 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 136.3MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.21ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 78.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.63ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 76.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.77ms. Allocated memory is still 136.3MB. Free memory was 76.0MB in the beginning and 73.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.99ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 73.5MB in the beginning and 151.2MB in the end (delta: -77.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 70383.45ms. Allocated memory was 186.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 150.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 158.61ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___2~0 * 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, 109 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 70.3s, OverallIterations: 40, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6986 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6788 mSDsluCounter, 15337 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9017 mSDsCounter, 833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4982 IncrementalHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 833 mSolverCounterUnsat, 6320 mSDtfsCounter, 4982 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5924 GetRequests, 5687 SyntacticMatches, 3 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19873occurred in iteration=26, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 15060 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 14116 PreInvPairs, 14849 NumberOfFragments, 7285 HoareAnnotationTreeSize, 14116 FomulaSimplifications, 58744 FormulaSimplificationTreeSizeReduction, 8.4s HoareSimplificationTime, 25 FomulaSimplificationsInter, 61146 FormulaSimplificationTreeSizeReductionInter, 17.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 10653 NumberOfCodeBlocks, 10653 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 10972 ConstructedInterpolants, 0 QuantifiedInterpolants, 17967 SizeOfPredicates, 8 NumberOfNonLiveVariables, 11018 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 60 InterpolantComputations, 38 PerfectInterpolantSequences, 18789/19221 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: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((C_1_pc == 1) && ((((((((((e <= 0) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((2 <= P_1_ev) && (e <= 0)) && (0 <= i)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))))) && (C_1_i == 1))) || (((((((((2 <= P_1_ev) && (C_1_pc == 1)) && (e <= 0)) && (0 <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((2 <= P_1_ev) && (C_1_pc == 1)) && (e <= 0)) && (0 <= i)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((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)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((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)) && !((P_1_st == 0)))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (0 <= i)) && (num <= 2)) && ((i + 1) <= max_loop)) && (1 <= P_1_pc)) && (1 <= num)) && !((num == 1))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (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))) || (((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((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_st == 0))) && (C_1_i == 1))) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((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)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((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)) && (0 <= i)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((C_1_pc <= 1) && (e <= 0)) && (0 <= i)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((2 <= P_1_ev) && (C_1_pc == 1)) && (e <= 0)) && (0 <= i)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (0 <= num)) && (C_1_i == 1))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((0 <= i) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((0 <= i) && (C_1_pc == 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((C_1_pc <= 1) && (e <= 0)) && (0 <= i)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((0 <= i) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((((C_1_pc == 1) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || ((((((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) || ((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0)))) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((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)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((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)) && (0 <= i)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (P_1_st == 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || ((((((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((C_1_pc <= 1) && (e <= 0)) && (0 <= i)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((2 <= P_1_ev) && (C_1_pc == 1)) && (e <= 0)) && (0 <= i)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (0 <= num)) && (C_1_i == 1))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((0 <= i) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((0 <= i) && (C_1_pc == 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((C_1_pc <= 1) && (e <= 0)) && (0 <= i)) && (P_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)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((0 <= i) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((((C_1_pc == 1) && (e <= 0)) && (0 <= i)) && (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))) || (((((((((((C_1_pc == 1) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((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)) && (i == 1)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (0 <= i)) && (P_1_st == 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || ((((((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (P_1_ev <= 0)) && (i <= 1)) && (C_1_ev <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) || ((((((((2 == C_1_pc) && (e <= 0)) && (0 <= i)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0)))) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:37:17,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9820a797-714b-4d3c-b686-5cc921def930/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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