./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:33:13,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:33:13,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:33:13,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:33:13,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:33:13,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:33:13,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:33:13,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:33:13,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:33:13,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:33:13,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:33:13,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:33:13,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:33:13,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:33:13,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:33:13,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:33:13,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:33:13,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:33:13,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:33:13,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:33:13,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:33:13,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:33:13,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:33:13,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:33:13,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:33:13,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:33:13,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:33:13,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:33:13,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:33:13,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:33:13,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:33:13,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:33:13,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:33:13,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:33:13,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:33:13,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:33:13,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:33:13,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:33:13,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:33:13,298 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2024-11-10 18:33:13,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:33:13,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:33:13,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:33:13,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:33:13,526 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:33:13,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-11-10 18:33:14,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:33:15,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:33:15,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-11-10 18:33:15,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b1116b5/044e29cbaf774d0dab717602931dfac5/FLAGb88906b87 [2024-11-10 18:33:15,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b1116b5/044e29cbaf774d0dab717602931dfac5 [2024-11-10 18:33:15,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:33:15,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:33:15,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:33:15,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:33:15,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:33:15,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faac68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15, skipping insertion in model container [2024-11-10 18:33:15,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:33:15,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:33:15,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:33:15,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:33:15,403 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:33:15,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15 WrapperNode [2024-11-10 18:33:15,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:33:15,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:33:15,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:33:15,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:33:15,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,445 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2024-11-10 18:33:15,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:33:15,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:33:15,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:33:15,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:33:15,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:33:15,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:33:15,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:33:15,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:33:15,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:33:15,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (1/1) ... [2024-11-10 18:33:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:33:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:15,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:33:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:33:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:33:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:33:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:33:15,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:33:15,618 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:33:15,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:33:15,933 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-10 18:33:15,933 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:33:15,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:33:15,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:33:15,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:15 BoogieIcfgContainer [2024-11-10 18:33:15,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:33:15,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:33:15,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:33:15,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:33:15,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:33:15" (1/3) ... [2024-11-10 18:33:15,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a78391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:15, skipping insertion in model container [2024-11-10 18:33:15,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:15" (2/3) ... [2024-11-10 18:33:15,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a78391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:15, skipping insertion in model container [2024-11-10 18:33:15,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:15" (3/3) ... [2024-11-10 18:33:15,969 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2024-11-10 18:33:15,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:33:15,982 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-10 18:33:16,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:33:16,042 INFO L333 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, 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;@502aec8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:33:16,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-10 18:33:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 149 states have internal predecessors, (186), 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) [2024-11-10 18:33:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 18:33:16,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:16,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 18:33:16,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 6832991, now seen corresponding path program 1 times [2024-11-10 18:33:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955545302] [2024-11-10 18:33:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955545302] [2024-11-10 18:33:16,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955545302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:16,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:33:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49132158] [2024-11-10 18:33:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:33:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:33:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:33:16,233 INFO L87 Difference]: Start difference. First operand has 150 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 149 states have internal predecessors, (186), 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 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2024-11-10 18:33:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:16,258 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2024-11-10 18:33:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:33:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-10 18:33:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:16,269 INFO L225 Difference]: With dead ends: 187 [2024-11-10 18:33:16,270 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 18:33:16,272 INFO L431 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 [2024-11-10 18:33:16,275 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 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 [2024-11-10 18:33:16,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 18:33:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 18:33:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 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) [2024-11-10 18:33:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2024-11-10 18:33:16,325 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 4 [2024-11-10 18:33:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:16,327 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2024-11-10 18:33:16,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2024-11-10 18:33:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2024-11-10 18:33:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:33:16,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:16,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:16,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:33:16,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash -41233291, now seen corresponding path program 1 times [2024-11-10 18:33:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276932739] [2024-11-10 18:33:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276932739] [2024-11-10 18:33:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276932739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:33:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763421026] [2024-11-10 18:33:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:33:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:33:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:33:16,484 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-10 18:33:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:16,611 INFO L93 Difference]: Finished difference Result 201 states and 276 transitions. [2024-11-10 18:33:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:33:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-10 18:33:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:16,612 INFO L225 Difference]: With dead ends: 201 [2024-11-10 18:33:16,613 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 18:33:16,613 INFO L431 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 [2024-11-10 18:33:16,614 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:16,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 181 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 18:33:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-10 18:33:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.28) internal successors, (160), 125 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) [2024-11-10 18:33:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2024-11-10 18:33:16,627 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 21 [2024-11-10 18:33:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:16,629 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2024-11-10 18:33:16,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-10 18:33:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2024-11-10 18:33:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 18:33:16,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:16,631 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 18:33:16,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:33:16,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1088264836, now seen corresponding path program 1 times [2024-11-10 18:33:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604605982] [2024-11-10 18:33:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:16,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:16,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604605982] [2024-11-10 18:33:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604605982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:16,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:16,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249303679] [2024-11-10 18:33:16,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:16,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:16,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:16,760 INFO L87 Difference]: Start difference. First operand 126 states and 160 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) [2024-11-10 18:33:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:16,975 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2024-11-10 18:33:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:33:16,976 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 30 [2024-11-10 18:33:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:16,977 INFO L225 Difference]: With dead ends: 280 [2024-11-10 18:33:16,977 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 18:33:16,978 INFO L431 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 [2024-11-10 18:33:16,979 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:16,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 250 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 18:33:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 155. [2024-11-10 18:33:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 154 states have internal predecessors, (201), 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) [2024-11-10 18:33:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2024-11-10 18:33:17,000 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 30 [2024-11-10 18:33:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:17,000 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2024-11-10 18:33:17,000 INFO L472 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) [2024-11-10 18:33:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2024-11-10 18:33:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 18:33:17,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:17,002 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-10 18:33:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:33:17,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -779179533, now seen corresponding path program 1 times [2024-11-10 18:33:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:17,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551963524] [2024-11-10 18:33:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 18:33:17,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:17,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551963524] [2024-11-10 18:33:17,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551963524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:17,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:17,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:17,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731399237] [2024-11-10 18:33:17,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:17,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:17,209 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2024-11-10 18:33:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:17,331 INFO L93 Difference]: Finished difference Result 401 states and 520 transitions. [2024-11-10 18:33:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2024-11-10 18:33:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:17,333 INFO L225 Difference]: With dead ends: 401 [2024-11-10 18:33:17,333 INFO L226 Difference]: Without dead ends: 278 [2024-11-10 18:33:17,334 INFO L431 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 [2024-11-10 18:33:17,335 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 131 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:17,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 375 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-10 18:33:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 172. [2024-11-10 18:33:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.2923976608187135) internal successors, (221), 171 states have internal predecessors, (221), 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) [2024-11-10 18:33:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2024-11-10 18:33:17,353 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 39 [2024-11-10 18:33:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2024-11-10 18:33:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2024-11-10 18:33:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2024-11-10 18:33:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:33:17,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:17,359 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-10 18:33:17,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:33:17,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1982968911, now seen corresponding path program 1 times [2024-11-10 18:33:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148249456] [2024-11-10 18:33:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 18:33:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148249456] [2024-11-10 18:33:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148249456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991004247] [2024-11-10 18:33:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:17,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:17,558 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2024-11-10 18:33:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:17,666 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2024-11-10 18:33:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 43 [2024-11-10 18:33:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:17,668 INFO L225 Difference]: With dead ends: 409 [2024-11-10 18:33:17,668 INFO L226 Difference]: Without dead ends: 286 [2024-11-10 18:33:17,669 INFO L431 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 [2024-11-10 18:33:17,669 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:17,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 364 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-10 18:33:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2024-11-10 18:33:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2727272727272727) internal successors, (238), 187 states have internal predecessors, (238), 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) [2024-11-10 18:33:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 238 transitions. [2024-11-10 18:33:17,677 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 238 transitions. Word has length 43 [2024-11-10 18:33:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:17,678 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 238 transitions. [2024-11-10 18:33:17,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2024-11-10 18:33:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 238 transitions. [2024-11-10 18:33:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 18:33:17,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:17,679 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-10 18:33:17,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:33:17,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:17,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash 769530539, now seen corresponding path program 1 times [2024-11-10 18:33:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:17,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371795735] [2024-11-10 18:33:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:17,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371795735] [2024-11-10 18:33:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371795735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494187134] [2024-11-10 18:33:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:17,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:17,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:17,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:33:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:17,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:33:17,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:33:17,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494187134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:17,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:17,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-10 18:33:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047065898] [2024-11-10 18:33:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:17,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:33:17,908 INFO L87 Difference]: Start difference. First operand 188 states and 238 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-10 18:33:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:18,068 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2024-11-10 18:33:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:18,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 47 [2024-11-10 18:33:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:18,070 INFO L225 Difference]: With dead ends: 369 [2024-11-10 18:33:18,072 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 18:33:18,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:33:18,073 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 56 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:18,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 305 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 18:33:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 223. [2024-11-10 18:33:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 222 states have internal predecessors, (279), 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) [2024-11-10 18:33:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2024-11-10 18:33:18,083 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 47 [2024-11-10 18:33:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2024-11-10 18:33:18,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-10 18:33:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2024-11-10 18:33:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 18:33:18,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:18,085 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-10 18:33:18,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:33:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 18:33:18,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2103895374, now seen corresponding path program 1 times [2024-11-10 18:33:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852534292] [2024-11-10 18:33:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852534292] [2024-11-10 18:33:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852534292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635334394] [2024-11-10 18:33:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:18,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:18,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:33:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:18,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:33:18,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:33:18,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635334394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:18,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:18,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-10 18:33:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453121125] [2024-11-10 18:33:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:18,559 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-10 18:33:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:18,697 INFO L93 Difference]: Finished difference Result 439 states and 574 transitions. [2024-11-10 18:33:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 56 [2024-11-10 18:33:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:18,699 INFO L225 Difference]: With dead ends: 439 [2024-11-10 18:33:18,699 INFO L226 Difference]: Without dead ends: 284 [2024-11-10 18:33:18,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:18,700 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:18,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 305 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-10 18:33:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2024-11-10 18:33:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.2430278884462151) internal successors, (312), 251 states have internal predecessors, (312), 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) [2024-11-10 18:33:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 312 transitions. [2024-11-10 18:33:18,716 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 312 transitions. Word has length 56 [2024-11-10 18:33:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:18,718 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 312 transitions. [2024-11-10 18:33:18,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-10 18:33:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 312 transitions. [2024-11-10 18:33:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 18:33:18,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:18,722 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:18,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:33:18,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 18:33:18,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:18,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash 416048681, now seen corresponding path program 1 times [2024-11-10 18:33:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165065186] [2024-11-10 18:33:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:33:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165065186] [2024-11-10 18:33:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165065186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:33:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875847367] [2024-11-10 18:33:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:33:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:33:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:33:19,009 INFO L87 Difference]: Start difference. First operand 252 states and 312 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-10 18:33:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:19,022 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2024-11-10 18:33:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:33:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 65 [2024-11-10 18:33:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:19,025 INFO L225 Difference]: With dead ends: 307 [2024-11-10 18:33:19,025 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 18:33:19,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:33:19,026 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 259 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 [2024-11-10 18:33:19,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 259 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 18:33:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-10 18:33:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 218 states have internal predecessors, (269), 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) [2024-11-10 18:33:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2024-11-10 18:33:19,032 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 65 [2024-11-10 18:33:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:19,033 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2024-11-10 18:33:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-10 18:33:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2024-11-10 18:33:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 18:33:19,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:19,037 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:19,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:33:19,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:19,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1470786825, now seen corresponding path program 1 times [2024-11-10 18:33:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:19,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215804257] [2024-11-10 18:33:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 18:33:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215804257] [2024-11-10 18:33:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215804257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:33:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127749871] [2024-11-10 18:33:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:33:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:33:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:33:19,164 INFO L87 Difference]: Start difference. First operand 219 states and 269 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) [2024-11-10 18:33:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:19,279 INFO L93 Difference]: Finished difference Result 558 states and 690 transitions. [2024-11-10 18:33:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:33:19,279 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 77 [2024-11-10 18:33:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:19,280 INFO L225 Difference]: With dead ends: 558 [2024-11-10 18:33:19,280 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 18:33:19,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:19,281 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:19,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 275 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 18:33:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2024-11-10 18:33:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.2313432835820894) internal successors, (330), 268 states have internal predecessors, (330), 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) [2024-11-10 18:33:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 330 transitions. [2024-11-10 18:33:19,309 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 330 transitions. Word has length 77 [2024-11-10 18:33:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:19,309 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 330 transitions. [2024-11-10 18:33:19,309 INFO L472 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) [2024-11-10 18:33:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 330 transitions. [2024-11-10 18:33:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 18:33:19,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:19,309 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2024-11-10 18:33:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:33:19,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:19,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash -418312034, now seen corresponding path program 1 times [2024-11-10 18:33:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128102403] [2024-11-10 18:33:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 18:33:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128102403] [2024-11-10 18:33:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128102403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014494689] [2024-11-10 18:33:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:19,439 INFO L87 Difference]: Start difference. First operand 269 states and 330 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2024-11-10 18:33:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:19,491 INFO L93 Difference]: Finished difference Result 603 states and 741 transitions. [2024-11-10 18:33:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 80 [2024-11-10 18:33:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:19,493 INFO L225 Difference]: With dead ends: 603 [2024-11-10 18:33:19,493 INFO L226 Difference]: Without dead ends: 399 [2024-11-10 18:33:19,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:19,494 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 80 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:19,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 498 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-10 18:33:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 291. [2024-11-10 18:33:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.2551724137931035) internal successors, (364), 290 states have internal predecessors, (364), 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) [2024-11-10 18:33:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 364 transitions. [2024-11-10 18:33:19,500 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 364 transitions. Word has length 80 [2024-11-10 18:33:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 364 transitions. [2024-11-10 18:33:19,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2024-11-10 18:33:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 364 transitions. [2024-11-10 18:33:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 18:33:19,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:19,501 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 18:33:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:33:19,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1713377239, now seen corresponding path program 1 times [2024-11-10 18:33:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574219805] [2024-11-10 18:33:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:33:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574219805] [2024-11-10 18:33:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574219805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488738282] [2024-11-10 18:33:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:19,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:19,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:33:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:19,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:33:19,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:33:19,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488738282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-10 18:33:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320726822] [2024-11-10 18:33:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:19,681 INFO L87 Difference]: Start difference. First operand 291 states and 364 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-10 18:33:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:19,755 INFO L93 Difference]: Finished difference Result 766 states and 963 transitions. [2024-11-10 18:33:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 87 [2024-11-10 18:33:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:19,758 INFO L225 Difference]: With dead ends: 766 [2024-11-10 18:33:19,758 INFO L226 Difference]: Without dead ends: 540 [2024-11-10 18:33:19,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:19,758 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 44 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:19,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 308 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-10 18:33:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 457. [2024-11-10 18:33:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.2587719298245614) internal successors, (574), 456 states have internal predecessors, (574), 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) [2024-11-10 18:33:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 574 transitions. [2024-11-10 18:33:19,781 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 574 transitions. Word has length 87 [2024-11-10 18:33:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 574 transitions. [2024-11-10 18:33:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-10 18:33:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 574 transitions. [2024-11-10 18:33:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 18:33:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:19,785 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:19,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:33:19,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:19,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:19,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 995708369, now seen corresponding path program 1 times [2024-11-10 18:33:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313913110] [2024-11-10 18:33:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:33:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313913110] [2024-11-10 18:33:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313913110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:33:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253344739] [2024-11-10 18:33:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:20,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:33:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:20,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:33:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:33:20,219 INFO L87 Difference]: Start difference. First operand 457 states and 574 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2024-11-10 18:33:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:20,501 INFO L93 Difference]: Finished difference Result 1202 states and 1507 transitions. [2024-11-10 18:33:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:33:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 87 [2024-11-10 18:33:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:20,503 INFO L225 Difference]: With dead ends: 1202 [2024-11-10 18:33:20,506 INFO L226 Difference]: Without dead ends: 744 [2024-11-10 18:33:20,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:33:20,507 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 189 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:20,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 291 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-10 18:33:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 644. [2024-11-10 18:33:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.2379471228615864) internal successors, (796), 643 states have internal predecessors, (796), 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) [2024-11-10 18:33:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 796 transitions. [2024-11-10 18:33:20,536 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 796 transitions. Word has length 87 [2024-11-10 18:33:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:20,536 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 796 transitions. [2024-11-10 18:33:20,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2024-11-10 18:33:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 796 transitions. [2024-11-10 18:33:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 18:33:20,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:20,537 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:20,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:33:20,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1628637905, now seen corresponding path program 1 times [2024-11-10 18:33:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100325876] [2024-11-10 18:33:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:33:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100325876] [2024-11-10 18:33:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100325876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:33:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921891829] [2024-11-10 18:33:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:33:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:33:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:33:20,725 INFO L87 Difference]: Start difference. First operand 644 states and 796 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2024-11-10 18:33:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:20,994 INFO L93 Difference]: Finished difference Result 1554 states and 1913 transitions. [2024-11-10 18:33:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:33:20,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 87 [2024-11-10 18:33:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:20,997 INFO L225 Difference]: With dead ends: 1554 [2024-11-10 18:33:21,001 INFO L226 Difference]: Without dead ends: 918 [2024-11-10 18:33:21,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:33:21,002 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 245 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:21,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 286 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-10 18:33:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 809. [2024-11-10 18:33:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.2252475247524752) internal successors, (990), 808 states have internal predecessors, (990), 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) [2024-11-10 18:33:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 990 transitions. [2024-11-10 18:33:21,041 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 990 transitions. Word has length 87 [2024-11-10 18:33:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:21,041 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 990 transitions. [2024-11-10 18:33:21,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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) [2024-11-10 18:33:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 990 transitions. [2024-11-10 18:33:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 18:33:21,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:21,045 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2024-11-10 18:33:21,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:33:21,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:21,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 95324053, now seen corresponding path program 1 times [2024-11-10 18:33:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868215543] [2024-11-10 18:33:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868215543] [2024-11-10 18:33:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868215543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439398614] [2024-11-10 18:33:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:21,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:33:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:21,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:33:21,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:33:21,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:21,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439398614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:21,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:21,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 18:33:21,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861419598] [2024-11-10 18:33:21,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:21,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:33:21,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:21,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:33:21,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:33:21,597 INFO L87 Difference]: Start difference. First operand 809 states and 990 transitions. Second operand has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 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) [2024-11-10 18:33:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:23,408 INFO L93 Difference]: Finished difference Result 4958 states and 5922 transitions. [2024-11-10 18:33:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-10 18:33:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 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 94 [2024-11-10 18:33:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:23,418 INFO L225 Difference]: With dead ends: 4958 [2024-11-10 18:33:23,419 INFO L226 Difference]: Without dead ends: 4033 [2024-11-10 18:33:23,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 18:33:23,421 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 796 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:23,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1752 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 18:33:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2024-11-10 18:33:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 1022. [2024-11-10 18:33:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 1.356513222331048) internal successors, (1385), 1021 states have internal predecessors, (1385), 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) [2024-11-10 18:33:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1385 transitions. [2024-11-10 18:33:23,468 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1385 transitions. Word has length 94 [2024-11-10 18:33:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:23,468 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1385 transitions. [2024-11-10 18:33:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 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) [2024-11-10 18:33:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1385 transitions. [2024-11-10 18:33:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 18:33:23,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:23,470 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2024-11-10 18:33:23,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:33:23,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:23,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:23,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 458976550, now seen corresponding path program 1 times [2024-11-10 18:33:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837465627] [2024-11-10 18:33:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:33:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837465627] [2024-11-10 18:33:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837465627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:33:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758612043] [2024-11-10 18:33:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:33:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:33:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:23,816 INFO L87 Difference]: Start difference. First operand 1022 states and 1385 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2024-11-10 18:33:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:24,070 INFO L93 Difference]: Finished difference Result 2408 states and 3251 transitions. [2024-11-10 18:33:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:33:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 94 [2024-11-10 18:33:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:24,074 INFO L225 Difference]: With dead ends: 2408 [2024-11-10 18:33:24,074 INFO L226 Difference]: Without dead ends: 1324 [2024-11-10 18:33:24,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:24,076 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 196 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:24,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 487 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-10 18:33:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1223. [2024-11-10 18:33:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 1.358428805237316) internal successors, (1660), 1222 states have internal predecessors, (1660), 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) [2024-11-10 18:33:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1660 transitions. [2024-11-10 18:33:24,103 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1660 transitions. Word has length 94 [2024-11-10 18:33:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:24,104 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1660 transitions. [2024-11-10 18:33:24,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2024-11-10 18:33:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1660 transitions. [2024-11-10 18:33:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 18:33:24,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:24,105 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2024-11-10 18:33:24,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:33:24,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1426140204, now seen corresponding path program 1 times [2024-11-10 18:33:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:24,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424481078] [2024-11-10 18:33:24,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:24,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-10 18:33:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424481078] [2024-11-10 18:33:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424481078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:24,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:24,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:33:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274388137] [2024-11-10 18:33:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:24,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:33:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:33:24,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:24,269 INFO L87 Difference]: Start difference. First operand 1223 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-11-10 18:33:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:24,513 INFO L93 Difference]: Finished difference Result 2745 states and 3720 transitions. [2024-11-10 18:33:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:33:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 94 [2024-11-10 18:33:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:24,517 INFO L225 Difference]: With dead ends: 2745 [2024-11-10 18:33:24,517 INFO L226 Difference]: Without dead ends: 1510 [2024-11-10 18:33:24,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:24,519 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 289 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:24,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 390 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-10 18:33:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1401. [2024-11-10 18:33:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.3628571428571428) internal successors, (1908), 1400 states have internal predecessors, (1908), 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) [2024-11-10 18:33:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1908 transitions. [2024-11-10 18:33:24,552 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1908 transitions. Word has length 94 [2024-11-10 18:33:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:24,552 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1908 transitions. [2024-11-10 18:33:24,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-11-10 18:33:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1908 transitions. [2024-11-10 18:33:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 18:33:24,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:24,554 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1] [2024-11-10 18:33:24,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 18:33:24,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:24,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -54900597, now seen corresponding path program 1 times [2024-11-10 18:33:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135555234] [2024-11-10 18:33:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 46 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:33:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:24,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135555234] [2024-11-10 18:33:24,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135555234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:24,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801969842] [2024-11-10 18:33:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:24,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:24,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:33:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:24,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:33:24,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:33:24,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801969842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:24,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-10 18:33:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403082229] [2024-11-10 18:33:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:24,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:33:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:33:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:33:24,945 INFO L87 Difference]: Start difference. First operand 1401 states and 1908 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-10 18:33:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:25,123 INFO L93 Difference]: Finished difference Result 4427 states and 6056 transitions. [2024-11-10 18:33:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:33:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 101 [2024-11-10 18:33:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:25,131 INFO L225 Difference]: With dead ends: 4427 [2024-11-10 18:33:25,131 INFO L226 Difference]: Without dead ends: 3077 [2024-11-10 18:33:25,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:25,134 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 214 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 565 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2024-11-10 18:33:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 1666. [2024-11-10 18:33:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.3027027027027027) internal successors, (2169), 1665 states have internal predecessors, (2169), 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) [2024-11-10 18:33:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2169 transitions. [2024-11-10 18:33:25,179 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2169 transitions. Word has length 101 [2024-11-10 18:33:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:25,179 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2169 transitions. [2024-11-10 18:33:25,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-10 18:33:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2169 transitions. [2024-11-10 18:33:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 18:33:25,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:25,181 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1] [2024-11-10 18:33:25,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:33:25,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 18:33:25,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:25,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 544365007, now seen corresponding path program 1 times [2024-11-10 18:33:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561163078] [2024-11-10 18:33:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-10 18:33:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561163078] [2024-11-10 18:33:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561163078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:33:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871482854] [2024-11-10 18:33:25,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:33:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:33:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:33:25,580 INFO L87 Difference]: Start difference. First operand 1666 states and 2169 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2024-11-10 18:33:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:25,809 INFO L93 Difference]: Finished difference Result 5133 states and 6674 transitions. [2024-11-10 18:33:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:33:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 101 [2024-11-10 18:33:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:25,821 INFO L225 Difference]: With dead ends: 5133 [2024-11-10 18:33:25,821 INFO L226 Difference]: Without dead ends: 4912 [2024-11-10 18:33:25,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:25,823 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 214 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:25,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 472 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2024-11-10 18:33:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 1666. [2024-11-10 18:33:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.3027027027027027) internal successors, (2169), 1665 states have internal predecessors, (2169), 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) [2024-11-10 18:33:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2169 transitions. [2024-11-10 18:33:25,883 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2169 transitions. Word has length 101 [2024-11-10 18:33:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:25,883 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2169 transitions. [2024-11-10 18:33:25,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2024-11-10 18:33:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2169 transitions. [2024-11-10 18:33:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 18:33:25,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:25,885 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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] [2024-11-10 18:33:25,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:33:25,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1137080277, now seen corresponding path program 1 times [2024-11-10 18:33:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318221312] [2024-11-10 18:33:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-10 18:33:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318221312] [2024-11-10 18:33:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318221312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782337696] [2024-11-10 18:33:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:25,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:25,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:33:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:26,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:33:26,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-10 18:33:26,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782337696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-10 18:33:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480721175] [2024-11-10 18:33:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:26,100 INFO L87 Difference]: Start difference. First operand 1666 states and 2169 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2024-11-10 18:33:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:26,234 INFO L93 Difference]: Finished difference Result 3476 states and 4520 transitions. [2024-11-10 18:33:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 104 [2024-11-10 18:33:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:26,242 INFO L225 Difference]: With dead ends: 3476 [2024-11-10 18:33:26,243 INFO L226 Difference]: Without dead ends: 3222 [2024-11-10 18:33:26,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:33:26,244 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 66 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:26,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 237 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2024-11-10 18:33:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2628. [2024-11-10 18:33:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 1.3068138561096307) internal successors, (3433), 2627 states have internal predecessors, (3433), 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) [2024-11-10 18:33:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3433 transitions. [2024-11-10 18:33:26,333 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3433 transitions. Word has length 104 [2024-11-10 18:33:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:26,333 INFO L471 AbstractCegarLoop]: Abstraction has 2628 states and 3433 transitions. [2024-11-10 18:33:26,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2024-11-10 18:33:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3433 transitions. [2024-11-10 18:33:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 18:33:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:26,336 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:26,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:33:26,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:26,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:26,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -82468825, now seen corresponding path program 1 times [2024-11-10 18:33:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075077303] [2024-11-10 18:33:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 46 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:33:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075077303] [2024-11-10 18:33:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075077303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170721239] [2024-11-10 18:33:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:26,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:26,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 18:33:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:26,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 18:33:26,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-10 18:33:27,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-10 18:33:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170721239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:27,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2024-11-10 18:33:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141358403] [2024-11-10 18:33:27,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:27,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 18:33:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:27,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 18:33:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:33:27,325 INFO L87 Difference]: Start difference. First operand 2628 states and 3433 transitions. Second operand has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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) [2024-11-10 18:33:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:29,505 INFO L93 Difference]: Finished difference Result 17462 states and 21333 transitions. [2024-11-10 18:33:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-10 18:33:29,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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 105 [2024-11-10 18:33:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:29,535 INFO L225 Difference]: With dead ends: 17462 [2024-11-10 18:33:29,535 INFO L226 Difference]: Without dead ends: 14654 [2024-11-10 18:33:29,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2931 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1774, Invalid=7156, Unknown=0, NotChecked=0, Total=8930 [2024-11-10 18:33:29,541 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1940 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:29,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 2806 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:33:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14654 states. [2024-11-10 18:33:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14654 to 3128. [2024-11-10 18:33:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.2507195394947235) internal successors, (3911), 3127 states have internal predecessors, (3911), 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) [2024-11-10 18:33:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 3911 transitions. [2024-11-10 18:33:29,678 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 3911 transitions. Word has length 105 [2024-11-10 18:33:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 3128 states and 3911 transitions. [2024-11-10 18:33:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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) [2024-11-10 18:33:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 3911 transitions. [2024-11-10 18:33:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 18:33:29,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:29,680 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1] [2024-11-10 18:33:29,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 18:33:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:29,881 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash 216157395, now seen corresponding path program 1 times [2024-11-10 18:33:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435824480] [2024-11-10 18:33:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-10 18:33:30,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435824480] [2024-11-10 18:33:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435824480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:30,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397244713] [2024-11-10 18:33:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:30,063 INFO L87 Difference]: Start difference. First operand 3128 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-11-10 18:33:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:30,180 INFO L93 Difference]: Finished difference Result 3138 states and 3922 transitions. [2024-11-10 18:33:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 106 [2024-11-10 18:33:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:30,187 INFO L225 Difference]: With dead ends: 3138 [2024-11-10 18:33:30,187 INFO L226 Difference]: Without dead ends: 3134 [2024-11-10 18:33:30,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:30,188 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:30,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 300 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2024-11-10 18:33:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 3132. [2024-11-10 18:33:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 3131 states have (on average 1.2503992334717342) internal successors, (3915), 3131 states have internal predecessors, (3915), 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) [2024-11-10 18:33:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 3915 transitions. [2024-11-10 18:33:30,263 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 3915 transitions. Word has length 106 [2024-11-10 18:33:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 3915 transitions. [2024-11-10 18:33:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-11-10 18:33:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 3915 transitions. [2024-11-10 18:33:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 18:33:30,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:30,265 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1] [2024-11-10 18:33:30,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 18:33:30,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:30,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1884346396, now seen corresponding path program 1 times [2024-11-10 18:33:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35620694] [2024-11-10 18:33:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35620694] [2024-11-10 18:33:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35620694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654522601] [2024-11-10 18:33:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:30,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:30,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 18:33:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:30,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:33:30,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:33:30,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654522601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-10 18:33:30,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806203655] [2024-11-10 18:33:30,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:33:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:33:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:33:30,632 INFO L87 Difference]: Start difference. First operand 3132 states and 3915 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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) [2024-11-10 18:33:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:30,963 INFO L93 Difference]: Finished difference Result 7929 states and 9802 transitions. [2024-11-10 18:33:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:33:30,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 107 [2024-11-10 18:33:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:30,972 INFO L225 Difference]: With dead ends: 7929 [2024-11-10 18:33:30,972 INFO L226 Difference]: Without dead ends: 7083 [2024-11-10 18:33:30,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:33:30,975 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 272 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:30,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 866 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:33:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7083 states. [2024-11-10 18:33:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7083 to 4148. [2024-11-10 18:33:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4148 states, 4147 states have (on average 1.2495780081986978) internal successors, (5182), 4147 states have internal predecessors, (5182), 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) [2024-11-10 18:33:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 5182 transitions. [2024-11-10 18:33:31,087 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 5182 transitions. Word has length 107 [2024-11-10 18:33:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 4148 states and 5182 transitions. [2024-11-10 18:33:31,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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) [2024-11-10 18:33:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 5182 transitions. [2024-11-10 18:33:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 18:33:31,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:31,090 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1] [2024-11-10 18:33:31,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 18:33:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 18:33:31,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:31,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 57544357, now seen corresponding path program 1 times [2024-11-10 18:33:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037928563] [2024-11-10 18:33:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037928563] [2024-11-10 18:33:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037928563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873717900] [2024-11-10 18:33:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:31,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:31,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 18:33:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:31,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:33:31,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 18:33:31,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 18:33:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873717900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:31,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 18:33:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968403264] [2024-11-10 18:33:31,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:33:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:33:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:33:31,841 INFO L87 Difference]: Start difference. First operand 4148 states and 5182 transitions. Second operand has 13 states, 13 states have (on average 17.153846153846153) internal successors, (223), 13 states have internal predecessors, (223), 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) [2024-11-10 18:33:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:32,870 INFO L93 Difference]: Finished difference Result 16156 states and 19338 transitions. [2024-11-10 18:33:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-10 18:33:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.153846153846153) internal successors, (223), 13 states have internal predecessors, (223), 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 110 [2024-11-10 18:33:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:32,882 INFO L225 Difference]: With dead ends: 16156 [2024-11-10 18:33:32,882 INFO L226 Difference]: Without dead ends: 8635 [2024-11-10 18:33:32,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=1015, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 18:33:32,891 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 797 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:32,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 3132 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:33:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8635 states. [2024-11-10 18:33:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8635 to 1317. [2024-11-10 18:33:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.1998480243161094) internal successors, (1579), 1316 states have internal predecessors, (1579), 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) [2024-11-10 18:33:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1579 transitions. [2024-11-10 18:33:32,998 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1579 transitions. Word has length 110 [2024-11-10 18:33:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:32,998 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1579 transitions. [2024-11-10 18:33:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.153846153846153) internal successors, (223), 13 states have internal predecessors, (223), 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) [2024-11-10 18:33:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1579 transitions. [2024-11-10 18:33:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 18:33:33,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:33,000 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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, 1] [2024-11-10 18:33:33,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 18:33:33,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:33,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:33,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash 951420244, now seen corresponding path program 1 times [2024-11-10 18:33:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:33,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543088581] [2024-11-10 18:33:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 18:33:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543088581] [2024-11-10 18:33:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543088581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303754121] [2024-11-10 18:33:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:33,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:33,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 18:33:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:33,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:33:33,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 18:33:33,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303754121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-10 18:33:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596736858] [2024-11-10 18:33:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:33:33,526 INFO L87 Difference]: Start difference. First operand 1317 states and 1579 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-11-10 18:33:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:33,608 INFO L93 Difference]: Finished difference Result 1693 states and 2003 transitions. [2024-11-10 18:33:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 111 [2024-11-10 18:33:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:33,610 INFO L225 Difference]: With dead ends: 1693 [2024-11-10 18:33:33,610 INFO L226 Difference]: Without dead ends: 848 [2024-11-10 18:33:33,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:33:33,611 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:33,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 138 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-10 18:33:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 812. [2024-11-10 18:33:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.220715166461159) internal successors, (990), 811 states have internal predecessors, (990), 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) [2024-11-10 18:33:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 990 transitions. [2024-11-10 18:33:33,635 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 990 transitions. Word has length 111 [2024-11-10 18:33:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 990 transitions. [2024-11-10 18:33:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-11-10 18:33:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 990 transitions. [2024-11-10 18:33:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 18:33:33,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:33,636 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-10 18:33:33,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:33:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 18:33:33,840 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -707840020, now seen corresponding path program 1 times [2024-11-10 18:33:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224442353] [2024-11-10 18:33:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 32 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224442353] [2024-11-10 18:33:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224442353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531141270] [2024-11-10 18:33:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:34,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:34,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:34,085 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 18:33:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:34,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:33:34,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-10 18:33:34,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531141270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:34,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:34,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2024-11-10 18:33:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107685057] [2024-11-10 18:33:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:34,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:34,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:34,232 INFO L87 Difference]: Start difference. First operand 812 states and 990 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2024-11-10 18:33:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:34,296 INFO L93 Difference]: Finished difference Result 1483 states and 1798 transitions. [2024-11-10 18:33:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 118 [2024-11-10 18:33:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:34,298 INFO L225 Difference]: With dead ends: 1483 [2024-11-10 18:33:34,298 INFO L226 Difference]: Without dead ends: 662 [2024-11-10 18:33:34,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:34,299 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:34,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-10 18:33:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 480. [2024-11-10 18:33:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.2192066805845512) internal successors, (584), 479 states have internal predecessors, (584), 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) [2024-11-10 18:33:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 584 transitions. [2024-11-10 18:33:34,319 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 584 transitions. Word has length 118 [2024-11-10 18:33:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:34,319 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 584 transitions. [2024-11-10 18:33:34,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) [2024-11-10 18:33:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 584 transitions. [2024-11-10 18:33:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 18:33:34,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:34,321 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:34,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 18:33:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 18:33:34,521 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -577461451, now seen corresponding path program 1 times [2024-11-10 18:33:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779567819] [2024-11-10 18:33:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779567819] [2024-11-10 18:33:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779567819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38975627] [2024-11-10 18:33:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:35,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:35,106 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:35,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 18:33:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:35,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 18:33:35,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:35,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 18:33:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38975627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:37,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:37,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-10 18:33:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327483262] [2024-11-10 18:33:37,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:37,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 18:33:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:37,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 18:33:37,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:33:37,061 INFO L87 Difference]: Start difference. First operand 480 states and 584 transitions. Second operand has 25 states, 25 states have (on average 12.24) internal successors, (306), 25 states have internal predecessors, (306), 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) [2024-11-10 18:33:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:39,723 INFO L93 Difference]: Finished difference Result 2503 states and 2926 transitions. [2024-11-10 18:33:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-10 18:33:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.24) internal successors, (306), 25 states have internal predecessors, (306), 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 125 [2024-11-10 18:33:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:39,726 INFO L225 Difference]: With dead ends: 2503 [2024-11-10 18:33:39,727 INFO L226 Difference]: Without dead ends: 2493 [2024-11-10 18:33:39,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1041, Invalid=4215, Unknown=0, NotChecked=0, Total=5256 [2024-11-10 18:33:39,729 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1576 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:39,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 2163 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 18:33:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2024-11-10 18:33:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 831. [2024-11-10 18:33:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.2409638554216869) internal successors, (1030), 830 states have internal predecessors, (1030), 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) [2024-11-10 18:33:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1030 transitions. [2024-11-10 18:33:39,767 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1030 transitions. Word has length 125 [2024-11-10 18:33:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:39,768 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1030 transitions. [2024-11-10 18:33:39,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.24) internal successors, (306), 25 states have internal predecessors, (306), 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) [2024-11-10 18:33:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1030 transitions. [2024-11-10 18:33:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 18:33:39,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:39,769 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:39,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-10 18:33:39,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 18:33:39,970 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1444513676, now seen corresponding path program 1 times [2024-11-10 18:33:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:39,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129544570] [2024-11-10 18:33:39,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 12 proven. 110 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 18:33:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:40,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129544570] [2024-11-10 18:33:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129544570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:40,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219296796] [2024-11-10 18:33:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:40,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:40,887 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:33:40,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 18:33:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:41,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 18:33:41,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 18:33:41,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 18:33:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219296796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:42,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 10] total 31 [2024-11-10 18:33:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136642705] [2024-11-10 18:33:42,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 18:33:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 18:33:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2024-11-10 18:33:42,858 INFO L87 Difference]: Start difference. First operand 831 states and 1030 transitions. Second operand has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 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) [2024-11-10 18:33:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:56,923 INFO L93 Difference]: Finished difference Result 8179 states and 9671 transitions. [2024-11-10 18:33:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2024-11-10 18:33:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 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 125 [2024-11-10 18:33:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:56,933 INFO L225 Difference]: With dead ends: 8179 [2024-11-10 18:33:56,933 INFO L226 Difference]: Without dead ends: 7369 [2024-11-10 18:33:56,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9875 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=5227, Invalid=22163, Unknown=0, NotChecked=0, Total=27390 [2024-11-10 18:33:56,942 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 2728 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 5066 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:56,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 5066 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 18:33:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7369 states. [2024-11-10 18:33:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7369 to 1208. [2024-11-10 18:33:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 1.2468931234465617) internal successors, (1505), 1207 states have internal predecessors, (1505), 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) [2024-11-10 18:33:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1505 transitions. [2024-11-10 18:33:57,030 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1505 transitions. Word has length 125 [2024-11-10 18:33:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:57,030 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1505 transitions. [2024-11-10 18:33:57,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 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) [2024-11-10 18:33:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1505 transitions. [2024-11-10 18:33:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 18:33:57,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:57,032 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:57,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 18:33:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 18:33:57,234 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-10 18:33:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1356541171, now seen corresponding path program 2 times [2024-11-10 18:33:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369926145] [2024-11-10 18:33:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:33:57,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:33:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:33:57,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:33:57,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:33:57,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-11-10 18:33:57,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-11-10 18:33:57,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-11-10 18:33:57,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-11-10 18:33:57,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-11-10 18:33:57,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-11-10 18:33:57,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-11-10 18:33:57,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-11-10 18:33:57,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-11-10 18:33:57,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-11-10 18:33:57,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-11-10 18:33:57,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-11-10 18:33:57,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-11-10 18:33:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 18:33:57,347 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-11-10 18:33:57,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:33:57,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:33:57 BoogieIcfgContainer [2024-11-10 18:33:57,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:33:57,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:33:57,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:33:57,424 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:33:57,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:15" (3/4) ... [2024-11-10 18:33:57,426 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:33:57,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:33:57,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:33:57,497 INFO L158 Benchmark]: Toolchain (without parser) took 42396.94ms. Allocated memory was 125.8MB in the beginning and 734.0MB in the end (delta: 608.2MB). Free memory was 58.8MB in the beginning and 277.7MB in the end (delta: -218.9MB). Peak memory consumption was 391.5MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,498 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 125.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:33:57,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.01ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 58.5MB in the beginning and 177.9MB in the end (delta: -119.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.56ms. Allocated memory is still 209.7MB. Free memory was 177.9MB in the beginning and 173.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,498 INFO L158 Benchmark]: Boogie Preprocessor took 34.81ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 170.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,499 INFO L158 Benchmark]: IcfgBuilder took 481.36ms. Allocated memory is still 209.7MB. Free memory was 170.6MB in the beginning and 140.1MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,499 INFO L158 Benchmark]: TraceAbstraction took 41459.35ms. Allocated memory was 209.7MB in the beginning and 734.0MB in the end (delta: 524.3MB). Free memory was 140.1MB in the beginning and 288.2MB in the end (delta: -148.1MB). Peak memory consumption was 377.3MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,499 INFO L158 Benchmark]: Witness Printer took 72.67ms. Allocated memory is still 734.0MB. Free memory was 288.2MB in the beginning and 277.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:33:57,501 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 125.8MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.01ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 58.5MB in the beginning and 177.9MB in the end (delta: -119.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.56ms. Allocated memory is still 209.7MB. Free memory was 177.9MB in the beginning and 173.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.81ms. Allocated memory is still 209.7MB. Free memory was 173.7MB in the beginning and 170.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 481.36ms. Allocated memory is still 209.7MB. Free memory was 170.6MB in the beginning and 140.1MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41459.35ms. Allocated memory was 209.7MB in the beginning and 734.0MB in the end (delta: 524.3MB). Free memory was 140.1MB in the beginning and 288.2MB in the end (delta: -148.1MB). Peak memory consumption was 377.3MB. Max. memory is 16.1GB. * Witness Printer took 72.67ms. Allocated memory is still 734.0MB. Free memory was 288.2MB in the beginning and 277.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] partial_sum = partial_sum + a0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] EXPR partial_sum + b0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] partial_sum = partial_sum + b0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] partial_sum = partial_sum + a1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L89] COND TRUE i < nb VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] EXPR partial_sum + b1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] partial_sum = partial_sum + b1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] i = i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, 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 [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] partial_sum = partial_sum + a2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L92] EXPR partial_sum + b2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L92] partial_sum = partial_sum + b2 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L104] EXPR i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L104] i = i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L83] COND TRUE i < na VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] COND TRUE i == (unsigned char)3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] EXPR partial_sum + a3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] partial_sum = partial_sum + a3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L89] COND TRUE i < nb VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L93] COND TRUE i == (unsigned char)3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L93] EXPR partial_sum + b3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=0, r1=0, r2=255] [L93] partial_sum = partial_sum + b3 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L104] EXPR i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L104] i = i + (unsigned char)1 VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=0, r2=255, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=0, r2=255, r3=128] [L116] EXPR r1 << 8U VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=0, r2=255, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, r2=255, r3=128] [L116] EXPR r2 << 16U VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, r2=255, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13, r3=128] [L116] r3 << 24U VAL [a0=-2365542757, a1=7536814, a2=29440, a3=115, b0=234770789, b1=917073, b2=3582, b3=13] - 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. - 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 41.3s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10431 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10431 mSDsluCounter, 22419 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17752 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8232 IncrementalHoareTripleChecker+Invalid, 8861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 4667 mSDtfsCounter, 8232 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2436 GetRequests, 1901 SyntacticMatches, 3 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 15736 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4148occurred in iteration=22, InterpolantAutomatonStates: 474, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 39153 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 3633 NumberOfCodeBlocks, 3633 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4022 ConstructedInterpolants, 40 QuantifiedInterpolants, 22151 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2534 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 45 InterpolantComputations, 22 PerfectInterpolantSequences, 2873/3802 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! [2024-11-10 18:33:57,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)