./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30e01a73 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_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ --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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:38:36,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:38:36,636 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-23 22:38:36,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:38:36,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:38:36,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:38:36,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:38:36,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:38:36,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:38:36,668 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:38:36,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:38:36,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:38:36,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:38:36,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:38:36,671 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:38:36,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:38:36,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:38:36,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:38:36,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:38:36,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:38:36,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:38:36,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:38:36,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:38:36,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:38:36,676 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-23 22:38:36,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:38:36,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:38:36,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:38:36,678 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:38:36,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:38:36,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:38:36,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:38:36,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:38:36,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:38:36,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:38:36,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:38:36,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:38:36,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:38:36,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:38:36,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:38:36,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:38:36,683 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:38:36,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:38:36,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:38:36,684 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_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/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_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ 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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2023-11-23 22:38:36,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:38:37,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:38:37,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:38:37,025 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:38:37,026 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:38:37,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-23 22:38:40,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:38:40,435 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:38:40,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-23 22:38:40,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/data/45632de66/b571014956d94248a79113a6f8437015/FLAG6a1ef211b [2023-11-23 22:38:40,461 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/data/45632de66/b571014956d94248a79113a6f8437015 [2023-11-23 22:38:40,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:38:40,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:38:40,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:38:40,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:38:40,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:38:40,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca54fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40, skipping insertion in model container [2023-11-23 22:38:40,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:38:40,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:38:40,756 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:38:40,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:38:40,816 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:38:40,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40 WrapperNode [2023-11-23 22:38:40,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:38:40,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:38:40,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:38:40,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:38:40,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,895 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2023-11-23 22:38:40,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:38:40,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:38:40,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:38:40,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:38:40,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,923 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,945 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:38:40,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:40,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:38:40,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:38:40,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:38:40,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:38:40,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (1/1) ... [2023-11-23 22:38:41,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:38:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:41,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:38:41,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:38:41,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:38:41,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:38:41,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:38:41,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:38:41,177 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:38:41,180 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:38:41,808 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:38:41,860 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:38:41,860 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 22:38:41,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:38:41 BoogieIcfgContainer [2023-11-23 22:38:41,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:38:41,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:38:41,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:38:41,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:38:41,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:38:40" (1/3) ... [2023-11-23 22:38:41,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe70135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:38:41, skipping insertion in model container [2023-11-23 22:38:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:38:40" (2/3) ... [2023-11-23 22:38:41,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe70135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:38:41, skipping insertion in model container [2023-11-23 22:38:41,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:38:41" (3/3) ... [2023-11-23 22:38:41,878 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2023-11-23 22:38:41,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:38:41,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-23 22:38:41,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:38:41,977 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;@18f4fe6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:38:41,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-23 22:38:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 82 states have (on average 1.951219512195122) internal successors, (160), 123 states have internal predecessors, (160), 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-23 22:38:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 22:38:41,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:41,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 22:38:41,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:42,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 337472, now seen corresponding path program 1 times [2023-11-23 22:38:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681886860] [2023-11-23 22:38:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:42,190 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-23 22:38:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681886860] [2023-11-23 22:38:42,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681886860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:42,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:42,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:38:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590561036] [2023-11-23 22:38:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:42,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:38:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:42,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:38:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:38:42,233 INFO L87 Difference]: Start difference. First operand has 124 states, 82 states have (on average 1.951219512195122) internal successors, (160), 123 states have internal predecessors, (160), 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) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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-23 22:38:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:42,271 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2023-11-23 22:38:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:38:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2023-11-23 22:38:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:42,284 INFO L225 Difference]: With dead ends: 152 [2023-11-23 22:38:42,284 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 22:38:42,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:38:42,294 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:42,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:38:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 22:38:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-23 22:38:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 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-23 22:38:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-23 22:38:42,355 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 3 [2023-11-23 22:38:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:42,355 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-23 22:38:42,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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-23 22:38:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-23 22:38:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 22:38:42,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:42,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:42,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:38:42,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:42,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash 618880512, now seen corresponding path program 1 times [2023-11-23 22:38:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:42,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970460847] [2023-11-23 22:38:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:42,626 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-23 22:38:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970460847] [2023-11-23 22:38:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970460847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:38:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037958736] [2023-11-23 22:38:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:42,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:38:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:38:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:38:42,631 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-23 22:38:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:42,849 INFO L93 Difference]: Finished difference Result 160 states and 235 transitions. [2023-11-23 22:38:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:38:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2023-11-23 22:38:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:42,854 INFO L225 Difference]: With dead ends: 160 [2023-11-23 22:38:42,854 INFO L226 Difference]: Without dead ends: 105 [2023-11-23 22:38:42,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:38:42,861 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:42,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-23 22:38:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-23 22:38:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 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-23 22:38:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2023-11-23 22:38:42,901 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 18 [2023-11-23 22:38:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:42,901 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2023-11-23 22:38:42,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-23 22:38:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2023-11-23 22:38:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:38:42,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:42,903 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] [2023-11-23 22:38:42,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:38:42,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:42,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1543432602, now seen corresponding path program 1 times [2023-11-23 22:38:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:42,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954622074] [2023-11-23 22:38:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:38:43,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954622074] [2023-11-23 22:38:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954622074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:43,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:38:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005669021] [2023-11-23 22:38:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:43,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:43,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:43,132 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-23 22:38:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:43,454 INFO L93 Difference]: Finished difference Result 229 states and 340 transitions. [2023-11-23 22:38:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:38:43,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 25 [2023-11-23 22:38:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:43,460 INFO L225 Difference]: With dead ends: 229 [2023-11-23 22:38:43,461 INFO L226 Difference]: Without dead ends: 174 [2023-11-23 22:38:43,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-23 22:38:43,469 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 114 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:43,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 195 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:38:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-23 22:38:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-11-23 22:38:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 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-23 22:38:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-23 22:38:43,494 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 25 [2023-11-23 22:38:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-23 22:38:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-23 22:38:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-23 22:38:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 22:38:43,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:43,497 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 22:38:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:38:43,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:43,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1457126148, now seen corresponding path program 1 times [2023-11-23 22:38:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:43,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622746409] [2023-11-23 22:38:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 22:38:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622746409] [2023-11-23 22:38:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622746409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:43,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:38:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372537989] [2023-11-23 22:38:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:43,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:43,640 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-23 22:38:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:43,832 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2023-11-23 22:38:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:38:43,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 32 [2023-11-23 22:38:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:43,835 INFO L225 Difference]: With dead ends: 361 [2023-11-23 22:38:43,835 INFO L226 Difference]: Without dead ends: 259 [2023-11-23 22:38:43,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-23 22:38:43,837 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 140 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:43,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 347 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-23 22:38:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 139. [2023-11-23 22:38:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 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-23 22:38:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-11-23 22:38:43,878 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 32 [2023-11-23 22:38:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:43,879 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-11-23 22:38:43,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-23 22:38:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-11-23 22:38:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 22:38:43,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:43,883 INFO L195 NwaCegarLoop]: trace histogram [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-23 22:38:43,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:38:43,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:43,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 531249808, now seen corresponding path program 1 times [2023-11-23 22:38:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079245071] [2023-11-23 22:38:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 22:38:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:44,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079245071] [2023-11-23 22:38:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079245071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:44,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:38:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270887683] [2023-11-23 22:38:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:44,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:44,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:44,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:44,022 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-23 22:38:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:44,212 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2023-11-23 22:38:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:38:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) Word has length 35 [2023-11-23 22:38:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:44,215 INFO L225 Difference]: With dead ends: 367 [2023-11-23 22:38:44,215 INFO L226 Difference]: Without dead ends: 265 [2023-11-23 22:38:44,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-23 22:38:44,217 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:44,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 337 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-23 22:38:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 152. [2023-11-23 22:38:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 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-23 22:38:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2023-11-23 22:38:44,230 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 35 [2023-11-23 22:38:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:44,231 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2023-11-23 22:38:44,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-23 22:38:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2023-11-23 22:38:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 22:38:44,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:44,234 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 22:38:44,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:38:44,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:44,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1222917471, now seen corresponding path program 1 times [2023-11-23 22:38:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:44,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40509981] [2023-11-23 22:38:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:38:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40509981] [2023-11-23 22:38:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40509981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:44,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790697614] [2023-11-23 22:38:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:44,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:44,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:38:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:44,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 22:38:44,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 22:38:44,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:38:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790697614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:38:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-23 22:38:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682266108] [2023-11-23 22:38:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:38:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:38:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:38:44,550 INFO L87 Difference]: Start difference. First operand 152 states and 202 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-23 22:38:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:44,575 INFO L93 Difference]: Finished difference Result 252 states and 340 transitions. [2023-11-23 22:38:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:38:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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) Word has length 38 [2023-11-23 22:38:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:44,577 INFO L225 Difference]: With dead ends: 252 [2023-11-23 22:38:44,578 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 22:38:44,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:38:44,579 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:44,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:38:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 22:38:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-23 22:38:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 126 states have internal predecessors, (169), 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-23 22:38:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2023-11-23 22:38:44,587 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 38 [2023-11-23 22:38:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:44,588 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2023-11-23 22:38:44,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-23 22:38:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2023-11-23 22:38:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 22:38:44,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:44,590 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-23 22:38:44,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:44,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:44,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:44,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash -475046155, now seen corresponding path program 1 times [2023-11-23 22:38:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885237553] [2023-11-23 22:38:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:38:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885237553] [2023-11-23 22:38:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885237553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:38:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881793602] [2023-11-23 22:38:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:44,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:38:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:38:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:38:44,906 INFO L87 Difference]: Start difference. First operand 127 states and 169 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-23 22:38:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:44,921 INFO L93 Difference]: Finished difference Result 176 states and 236 transitions. [2023-11-23 22:38:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:38:44,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2023-11-23 22:38:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:44,923 INFO L225 Difference]: With dead ends: 176 [2023-11-23 22:38:44,923 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 22:38:44,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:38:44,925 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:44,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:38:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 22:38:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-11-23 22:38:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 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-23 22:38:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 193 transitions. [2023-11-23 22:38:44,940 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 193 transitions. Word has length 44 [2023-11-23 22:38:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:44,942 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 193 transitions. [2023-11-23 22:38:44,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-23 22:38:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 193 transitions. [2023-11-23 22:38:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 22:38:44,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:44,949 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-23 22:38:44,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:38:44,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:44,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1448181879, now seen corresponding path program 1 times [2023-11-23 22:38:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184942866] [2023-11-23 22:38:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:38:45,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184942866] [2023-11-23 22:38:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184942866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:38:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628306150] [2023-11-23 22:38:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:45,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:45,144 INFO L87 Difference]: Start difference. First operand 145 states and 193 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-23 22:38:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:45,380 INFO L93 Difference]: Finished difference Result 394 states and 557 transitions. [2023-11-23 22:38:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:38:45,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) Word has length 44 [2023-11-23 22:38:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:45,383 INFO L225 Difference]: With dead ends: 394 [2023-11-23 22:38:45,383 INFO L226 Difference]: Without dead ends: 276 [2023-11-23 22:38:45,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-23 22:38:45,385 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 130 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:45,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 153 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-23 22:38:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 193. [2023-11-23 22:38:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 192 states have internal predecessors, (268), 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-23 22:38:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2023-11-23 22:38:45,399 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 44 [2023-11-23 22:38:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:45,400 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2023-11-23 22:38:45,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-23 22:38:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2023-11-23 22:38:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 22:38:45,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:45,402 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 22:38:45,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:38:45,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:45,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1249012675, now seen corresponding path program 1 times [2023-11-23 22:38:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192885446] [2023-11-23 22:38:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 22:38:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192885446] [2023-11-23 22:38:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192885446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485625027] [2023-11-23 22:38:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:45,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:45,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:45,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:45,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:38:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:45,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:38:45,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 22:38:45,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:38:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485625027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:38:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-11-23 22:38:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279025360] [2023-11-23 22:38:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:38:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:38:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:38:45,827 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-23 22:38:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:45,935 INFO L93 Difference]: Finished difference Result 396 states and 566 transitions. [2023-11-23 22:38:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:38:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) Word has length 51 [2023-11-23 22:38:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:45,939 INFO L225 Difference]: With dead ends: 396 [2023-11-23 22:38:45,939 INFO L226 Difference]: Without dead ends: 225 [2023-11-23 22:38:45,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:38:45,942 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:45,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 136 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:38:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-23 22:38:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 166. [2023-11-23 22:38:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.3818181818181818) internal successors, (228), 165 states have internal predecessors, (228), 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-23 22:38:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2023-11-23 22:38:45,951 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 51 [2023-11-23 22:38:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:45,955 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2023-11-23 22:38:45,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-23 22:38:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2023-11-23 22:38:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 22:38:45,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:45,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-23 22:38:45,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:46,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:46,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:46,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1566411221, now seen corresponding path program 1 times [2023-11-23 22:38:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531054130] [2023-11-23 22:38:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:38:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531054130] [2023-11-23 22:38:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531054130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79453989] [2023-11-23 22:38:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:46,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:46,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:46,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:46,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:38:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:46,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 22:38:46,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 22:38:46,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:38:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79453989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:38:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-23 22:38:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965381065] [2023-11-23 22:38:46,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:46,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:46,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:38:46,626 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-23 22:38:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:46,771 INFO L93 Difference]: Finished difference Result 374 states and 531 transitions. [2023-11-23 22:38:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:38:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 69 [2023-11-23 22:38:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:46,775 INFO L225 Difference]: With dead ends: 374 [2023-11-23 22:38:46,775 INFO L226 Difference]: Without dead ends: 219 [2023-11-23 22:38:46,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:38:46,777 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:46,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 186 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:38:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-23 22:38:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2023-11-23 22:38:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 187 states have internal predecessors, (245), 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-23 22:38:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2023-11-23 22:38:46,788 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 69 [2023-11-23 22:38:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:46,788 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2023-11-23 22:38:46,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-23 22:38:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2023-11-23 22:38:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-23 22:38:46,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:46,791 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:46,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:47,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:47,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:47,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash -63426306, now seen corresponding path program 1 times [2023-11-23 22:38:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:47,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070366143] [2023-11-23 22:38:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:47,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-23 22:38:47,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070366143] [2023-11-23 22:38:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070366143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:47,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:38:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666290027] [2023-11-23 22:38:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:47,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:38:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:38:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:38:47,247 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-23 22:38:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:47,525 INFO L93 Difference]: Finished difference Result 734 states and 953 transitions. [2023-11-23 22:38:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:38:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 85 [2023-11-23 22:38:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:47,529 INFO L225 Difference]: With dead ends: 734 [2023-11-23 22:38:47,529 INFO L226 Difference]: Without dead ends: 567 [2023-11-23 22:38:47,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-23 22:38:47,531 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 231 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:47,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 531 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2023-11-23 22:38:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 188. [2023-11-23 22:38:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 187 states have internal predecessors, (245), 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-23 22:38:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2023-11-23 22:38:47,546 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 85 [2023-11-23 22:38:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:47,546 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2023-11-23 22:38:47,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-23 22:38:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2023-11-23 22:38:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-23 22:38:47,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:47,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:47,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:38:47,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:47,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1662703805, now seen corresponding path program 1 times [2023-11-23 22:38:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214039128] [2023-11-23 22:38:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-23 22:38:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214039128] [2023-11-23 22:38:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214039128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:47,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:38:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751575019] [2023-11-23 22:38:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:47,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:38:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:38:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:38:47,814 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-23 22:38:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:47,919 INFO L93 Difference]: Finished difference Result 609 states and 793 transitions. [2023-11-23 22:38:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:38:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) Word has length 88 [2023-11-23 22:38:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:47,922 INFO L225 Difference]: With dead ends: 609 [2023-11-23 22:38:47,922 INFO L226 Difference]: Without dead ends: 442 [2023-11-23 22:38:47,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-23 22:38:47,924 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 242 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:47,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 260 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:38:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-11-23 22:38:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 302. [2023-11-23 22:38:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 301 states have internal predecessors, (399), 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-23 22:38:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2023-11-23 22:38:47,942 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 88 [2023-11-23 22:38:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:47,942 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2023-11-23 22:38:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-23 22:38:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2023-11-23 22:38:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-23 22:38:47,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:47,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:47,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:38:47,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:47,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -534350089, now seen corresponding path program 1 times [2023-11-23 22:38:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253143522] [2023-11-23 22:38:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-23 22:38:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253143522] [2023-11-23 22:38:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253143522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:48,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:38:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119748971] [2023-11-23 22:38:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:48,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:38:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:38:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:38:48,171 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-23 22:38:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:48,624 INFO L93 Difference]: Finished difference Result 1514 states and 1987 transitions. [2023-11-23 22:38:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:38:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 88 [2023-11-23 22:38:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:48,632 INFO L225 Difference]: With dead ends: 1514 [2023-11-23 22:38:48,632 INFO L226 Difference]: Without dead ends: 1233 [2023-11-23 22:38:48,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:38:48,634 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 347 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:48,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 692 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:38:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-23 22:38:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 302. [2023-11-23 22:38:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 301 states have internal predecessors, (399), 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-23 22:38:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2023-11-23 22:38:48,664 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 88 [2023-11-23 22:38:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:48,665 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2023-11-23 22:38:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-23 22:38:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2023-11-23 22:38:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-23 22:38:48,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:48,667 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:38:48,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:48,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -697419044, now seen corresponding path program 1 times [2023-11-23 22:38:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958154515] [2023-11-23 22:38:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 22:38:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958154515] [2023-11-23 22:38:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958154515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011878437] [2023-11-23 22:38:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:48,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:48,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:48,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:38:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:48,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 22:38:49,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 22:38:49,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:38:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 22:38:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011878437] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:38:49,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:38:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2023-11-23 22:38:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690695299] [2023-11-23 22:38:49,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:38:49,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 22:38:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 22:38:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:38:49,237 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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-23 22:38:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:50,185 INFO L93 Difference]: Finished difference Result 1541 states and 2134 transitions. [2023-11-23 22:38:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 22:38:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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) Word has length 88 [2023-11-23 22:38:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:50,194 INFO L225 Difference]: With dead ends: 1541 [2023-11-23 22:38:50,194 INFO L226 Difference]: Without dead ends: 1172 [2023-11-23 22:38:50,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-11-23 22:38:50,196 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 509 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:50,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 583 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 22:38:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-23 22:38:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1014. [2023-11-23 22:38:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.3079960513326752) internal successors, (1325), 1013 states have internal predecessors, (1325), 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-23 22:38:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1325 transitions. [2023-11-23 22:38:50,272 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1325 transitions. Word has length 88 [2023-11-23 22:38:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:50,273 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 1325 transitions. [2023-11-23 22:38:50,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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-23 22:38:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1325 transitions. [2023-11-23 22:38:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 22:38:50,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:50,276 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:50,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 22:38:50,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:50,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 837868115, now seen corresponding path program 1 times [2023-11-23 22:38:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325917473] [2023-11-23 22:38:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 22:38:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325917473] [2023-11-23 22:38:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325917473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456861336] [2023-11-23 22:38:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:50,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:50,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:51,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 22:38:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:51,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 22:38:51,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 22:38:51,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:38:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 22:38:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456861336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:38:51,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:38:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-11-23 22:38:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138274826] [2023-11-23 22:38:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:38:51,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 22:38:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:51,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 22:38:51,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:38:51,684 INFO L87 Difference]: Start difference. First operand 1014 states and 1325 transitions. Second operand has 17 states, 16 states have (on average 15.0) internal successors, (240), 16 states have internal predecessors, (240), 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-23 22:38:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:53,068 INFO L93 Difference]: Finished difference Result 4501 states and 5618 transitions. [2023-11-23 22:38:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-23 22:38:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 15.0) internal successors, (240), 16 states have internal predecessors, (240), 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) Word has length 90 [2023-11-23 22:38:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:53,116 INFO L225 Difference]: With dead ends: 4501 [2023-11-23 22:38:53,117 INFO L226 Difference]: Without dead ends: 4416 [2023-11-23 22:38:53,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=1639, Unknown=0, NotChecked=0, Total=2256 [2023-11-23 22:38:53,121 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 965 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:53,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1198 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:38:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4416 states. [2023-11-23 22:38:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4416 to 1232. [2023-11-23 22:38:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.3452477660438669) internal successors, (1656), 1231 states have internal predecessors, (1656), 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-23 22:38:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1656 transitions. [2023-11-23 22:38:53,268 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1656 transitions. Word has length 90 [2023-11-23 22:38:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:53,268 INFO L495 AbstractCegarLoop]: Abstraction has 1232 states and 1656 transitions. [2023-11-23 22:38:53,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 15.0) internal successors, (240), 16 states have internal predecessors, (240), 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-23 22:38:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1656 transitions. [2023-11-23 22:38:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 22:38:53,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:53,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:53,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:53,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:53,478 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:53,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2121646733, now seen corresponding path program 1 times [2023-11-23 22:38:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:53,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913862646] [2023-11-23 22:38:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:53,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 22:38:53,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913862646] [2023-11-23 22:38:53,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913862646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:53,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323819018] [2023-11-23 22:38:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:53,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:53,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:53,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 22:38:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:53,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:38:53,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 22:38:53,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:38:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323819018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:38:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 22:38:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859557251] [2023-11-23 22:38:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:38:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:38:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:53,797 INFO L87 Difference]: Start difference. First operand 1232 states and 1656 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-23 22:38:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:54,032 INFO L93 Difference]: Finished difference Result 2779 states and 3767 transitions. [2023-11-23 22:38:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:38:54,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) Word has length 96 [2023-11-23 22:38:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:54,041 INFO L225 Difference]: With dead ends: 2779 [2023-11-23 22:38:54,041 INFO L226 Difference]: Without dead ends: 1746 [2023-11-23 22:38:54,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:38:54,046 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 73 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:54,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 172 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:38:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2023-11-23 22:38:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1453. [2023-11-23 22:38:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.3422865013774106) internal successors, (1949), 1452 states have internal predecessors, (1949), 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-23 22:38:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1949 transitions. [2023-11-23 22:38:54,188 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1949 transitions. Word has length 96 [2023-11-23 22:38:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:54,189 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1949 transitions. [2023-11-23 22:38:54,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-23 22:38:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1949 transitions. [2023-11-23 22:38:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-23 22:38:54,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:54,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 22:38:54,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:54,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:54,412 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:54,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -194984919, now seen corresponding path program 1 times [2023-11-23 22:38:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245019165] [2023-11-23 22:38:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 22:38:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245019165] [2023-11-23 22:38:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245019165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662603136] [2023-11-23 22:38:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:38:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:38:54,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:38:54,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 22:38:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:54,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:38:54,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:38:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 22:38:54,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:38:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 22:38:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662603136] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 22:38:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:38:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-11-23 22:38:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051907199] [2023-11-23 22:38:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:54,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:38:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:38:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:38:54,925 INFO L87 Difference]: Start difference. First operand 1453 states and 1949 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-23 22:38:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:55,271 INFO L93 Difference]: Finished difference Result 3910 states and 5291 transitions. [2023-11-23 22:38:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:38:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) Word has length 100 [2023-11-23 22:38:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:55,286 INFO L225 Difference]: With dead ends: 3910 [2023-11-23 22:38:55,286 INFO L226 Difference]: Without dead ends: 2775 [2023-11-23 22:38:55,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:38:55,289 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 158 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:55,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 205 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:38:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2023-11-23 22:38:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2345. [2023-11-23 22:38:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2344 states have (on average 1.3549488054607508) internal successors, (3176), 2344 states have internal predecessors, (3176), 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-23 22:38:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3176 transitions. [2023-11-23 22:38:55,480 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3176 transitions. Word has length 100 [2023-11-23 22:38:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:55,481 INFO L495 AbstractCegarLoop]: Abstraction has 2345 states and 3176 transitions. [2023-11-23 22:38:55,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-23 22:38:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3176 transitions. [2023-11-23 22:38:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-23 22:38:55,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:55,487 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-23 22:38:55,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 22:38:55,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 22:38:55,712 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:55,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash -513378972, now seen corresponding path program 1 times [2023-11-23 22:38:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204021991] [2023-11-23 22:38:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:38:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 22:38:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:38:55,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204021991] [2023-11-23 22:38:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204021991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:38:55,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:38:55,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:38:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539773448] [2023-11-23 22:38:55,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:38:55,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:38:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:38:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:38:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:38:55,992 INFO L87 Difference]: Start difference. First operand 2345 states and 3176 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-23 22:38:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:38:56,511 INFO L93 Difference]: Finished difference Result 5227 states and 7020 transitions. [2023-11-23 22:38:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:38:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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) Word has length 103 [2023-11-23 22:38:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:38:56,527 INFO L225 Difference]: With dead ends: 5227 [2023-11-23 22:38:56,527 INFO L226 Difference]: Without dead ends: 2882 [2023-11-23 22:38:56,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-11-23 22:38:56,557 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 227 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:38:56,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 262 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:38:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2023-11-23 22:38:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2043. [2023-11-23 22:38:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 2042 states have (on average 1.3207639569049952) internal successors, (2697), 2042 states have internal predecessors, (2697), 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-23 22:38:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2697 transitions. [2023-11-23 22:38:56,741 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2697 transitions. Word has length 103 [2023-11-23 22:38:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:38:56,742 INFO L495 AbstractCegarLoop]: Abstraction has 2043 states and 2697 transitions. [2023-11-23 22:38:56,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-23 22:38:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2697 transitions. [2023-11-23 22:38:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 22:38:56,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:38:56,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:38:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 22:38:56,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-23 22:38:56,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:38:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1184009150, now seen corresponding path program 1 times [2023-11-23 22:38:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:38:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728014574] [2023-11-23 22:38:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:38:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:38:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:38:56,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:38:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:38:56,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:38:56,992 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:38:56,995 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-23 22:38:56,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-23 22:38:56,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-23 22:38:56,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-23 22:38:56,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-23 22:38:56,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-23 22:38:56,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-23 22:38:56,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-23 22:38:56,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-23 22:38:56,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-23 22:38:56,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-23 22:38:57,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-23 22:38:57,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-23 22:38:57,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-23 22:38:57,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-23 22:38:57,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-23 22:38:57,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-23 22:38:57,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-23 22:38:57,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-23 22:38:57,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-23 22:38:57,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-23 22:38:57,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-23 22:38:57,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-23 22:38:57,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-23 22:38:57,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-23 22:38:57,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-23 22:38:57,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-23 22:38:57,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-23 22:38:57,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-23 22:38:57,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-23 22:38:57,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-23 22:38:57,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-23 22:38:57,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-23 22:38:57,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-23 22:38:57,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-23 22:38:57,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-23 22:38:57,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 22:38:57,011 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] [2023-11-23 22:38:57,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:38:57,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-23 22:38:57,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-23 22:38:57,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:38:57 BoogieIcfgContainer [2023-11-23 22:38:57,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:38:57,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:38:57,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:38:57,115 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:38:57,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:38:41" (3/4) ... [2023-11-23 22:38:57,116 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 22:38:57,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-23 22:38:57,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-23 22:38:57,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-23 22:38:57,222 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 22:38:57,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:38:57,223 INFO L158 Benchmark]: Toolchain (without parser) took 16757.02ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 107.8MB in the beginning and 102.8MB in the end (delta: 4.9MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,223 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 111.1MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:38:57,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.69ms. Allocated memory is still 146.8MB. Free memory was 107.4MB in the beginning and 94.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.81ms. Allocated memory is still 146.8MB. Free memory was 94.2MB in the beginning and 90.4MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,224 INFO L158 Benchmark]: Boogie Preprocessor took 96.04ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 87.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,224 INFO L158 Benchmark]: RCFGBuilder took 870.36ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 103.3MB in the end (delta: -16.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,225 INFO L158 Benchmark]: TraceAbstraction took 15246.73ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 102.4MB in the beginning and 112.3MB in the end (delta: -9.8MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,225 INFO L158 Benchmark]: Witness Printer took 107.52ms. Allocated memory is still 255.9MB. Free memory was 112.3MB in the beginning and 102.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 22:38:57,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 111.1MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.69ms. Allocated memory is still 146.8MB. Free memory was 107.4MB in the beginning and 94.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.81ms. Allocated memory is still 146.8MB. Free memory was 94.2MB in the beginning and 90.4MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.04ms. Allocated memory is still 146.8MB. Free memory was 90.4MB in the beginning and 87.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 870.36ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 103.3MB in the end (delta: -16.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15246.73ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 102.4MB in the beginning and 112.3MB in the end (delta: -9.8MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. * Witness Printer took 107.52ms. Allocated memory is still 255.9MB. Free memory was 112.3MB in the beginning and 102.8MB in the end (delta: 9.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: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] r3 << 24U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3513 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3513 mSDsluCounter, 5786 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3827 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2898 IncrementalHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 1959 mSDtfsCounter, 2898 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 975 GetRequests, 831 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2345occurred in iteration=17, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 6812 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1735 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 1262/1495 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-23 22:38:57,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85c0eb14-3b7b-48b6-9505-cee42c7bbfd7/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)