./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/s3_srvr_1a.BV.c.cil.c -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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:04:13,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:04:13,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:04:13,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:04:13,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:04:13,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:04:13,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:04:13,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:04:13,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:04:13,395 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:04:13,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:04:13,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:04:13,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:04:13,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:04:13,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:04:13,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:04:13,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:04:13,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:04:13,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:04:13,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:04:13,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:04:13,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:04:13,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:04:13,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:04:13,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:04:13,401 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:04:13,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:04:13,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:13,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:04:13,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:04:13,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:04:13,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:04:13,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:04:13,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:04:13,405 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2024-11-19 10:04:13,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:04:13,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:04:13,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:04:13,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:04:13,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:04:13,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-19 10:04:14,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:04:15,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:04:15,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-11-19 10:04:15,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1f1f498/d21da2de52a64ef8a0db135ba914c4cf/FLAG61384aef4 [2024-11-19 10:04:15,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1f1f498/d21da2de52a64ef8a0db135ba914c4cf [2024-11-19 10:04:15,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:04:15,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:04:15,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:15,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:04:15,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:04:15,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb779ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15, skipping insertion in model container [2024-11-19 10:04:15,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:04:15,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:15,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:04:15,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:15,517 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:04:15,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15 WrapperNode [2024-11-19 10:04:15,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:15,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:15,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:04:15,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:04:15,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,572 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 649 [2024-11-19 10:04:15,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:15,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:04:15,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:04:15,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:04:15,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,602 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-19 10:04:15,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:04:15,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:04:15,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:04:15,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:04:15,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (1/1) ... [2024-11-19 10:04:15,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:15,661 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-19 10:04:15,664 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-19 10:04:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:04:15,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:04:15,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:04:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:04:15,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:04:15,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:04:15,811 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 10:04:16,271 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-11-19 10:04:16,271 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-11-19 10:04:16,309 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-19 10:04:16,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:04:16,324 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:04:16,324 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:04:16,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:16 BoogieIcfgContainer [2024-11-19 10:04:16,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:04:16,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:04:16,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:04:16,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:04:16,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:15" (1/3) ... [2024-11-19 10:04:16,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc44b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:16, skipping insertion in model container [2024-11-19 10:04:16,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:15" (2/3) ... [2024-11-19 10:04:16,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc44b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:16, skipping insertion in model container [2024-11-19 10:04:16,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:16" (3/3) ... [2024-11-19 10:04:16,331 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-11-19 10:04:16,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:04:16,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:04:16,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:04:16,403 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;@68760a8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:04:16,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:04:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 173 states have (on average 1.716763005780347) internal successors, (297), 177 states have internal predecessors, (297), 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-19 10:04:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:04:16,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:16,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:16,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:16,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1337000495, now seen corresponding path program 1 times [2024-11-19 10:04:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330458784] [2024-11-19 10:04:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:16,744 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-19 10:04:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330458784] [2024-11-19 10:04:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330458784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593000178] [2024-11-19 10:04:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:16,777 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.716763005780347) internal successors, (297), 177 states have internal predecessors, (297), 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 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-19 10:04:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:16,957 INFO L93 Difference]: Finished difference Result 364 states and 609 transitions. [2024-11-19 10:04:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-19 10:04:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:16,968 INFO L225 Difference]: With dead ends: 364 [2024-11-19 10:04:16,969 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 10:04:16,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:16,977 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 94 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:16,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 381 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 10:04:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-19 10:04:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.5625) internal successors, (275), 179 states have internal predecessors, (275), 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-19 10:04:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2024-11-19 10:04:17,014 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 19 [2024-11-19 10:04:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2024-11-19 10:04:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-19 10:04:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2024-11-19 10:04:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:04:17,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:17,016 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] [2024-11-19 10:04:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:04:17,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1754046060, now seen corresponding path program 1 times [2024-11-19 10:04:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453026323] [2024-11-19 10:04:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:17,107 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-19 10:04:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:17,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453026323] [2024-11-19 10:04:17,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453026323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:17,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:17,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792150405] [2024-11-19 10:04:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:17,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,110 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 10:04:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:17,211 INFO L93 Difference]: Finished difference Result 355 states and 540 transitions. [2024-11-19 10:04:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-19 10:04:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:17,213 INFO L225 Difference]: With dead ends: 355 [2024-11-19 10:04:17,213 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 10:04:17,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,215 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 81 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:17,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 303 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 10:04:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2024-11-19 10:04:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 180 states have internal predecessors, (276), 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-19 10:04:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 276 transitions. [2024-11-19 10:04:17,223 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 276 transitions. Word has length 20 [2024-11-19 10:04:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,223 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 276 transitions. [2024-11-19 10:04:17,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 10:04:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 276 transitions. [2024-11-19 10:04:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:04:17,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:17,224 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-19 10:04:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:04:17,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 340971783, now seen corresponding path program 1 times [2024-11-19 10:04:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80098852] [2024-11-19 10:04:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:17,282 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-19 10:04:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80098852] [2024-11-19 10:04:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80098852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514494922] [2024-11-19 10:04:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:17,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,284 INFO L87 Difference]: Start difference. First operand 181 states and 276 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-19 10:04:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:17,375 INFO L93 Difference]: Finished difference Result 366 states and 560 transitions. [2024-11-19 10:04:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:17,375 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-19 10:04:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:17,376 INFO L225 Difference]: With dead ends: 366 [2024-11-19 10:04:17,377 INFO L226 Difference]: Without dead ends: 199 [2024-11-19 10:04:17,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,378 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:17,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 380 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-19 10:04:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-19 10:04:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.5333333333333334) internal successors, (299), 198 states have internal predecessors, (299), 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-19 10:04:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2024-11-19 10:04:17,409 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 21 [2024-11-19 10:04:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,411 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2024-11-19 10:04:17,411 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-19 10:04:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2024-11-19 10:04:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 10:04:17,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:17,412 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 10:04:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:04:17,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1548383466, now seen corresponding path program 1 times [2024-11-19 10:04:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865771739] [2024-11-19 10:04:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:17,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:17,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865771739] [2024-11-19 10:04:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865771739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:17,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:17,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692728427] [2024-11-19 10:04:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:17,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,478 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-19 10:04:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:17,631 INFO L93 Difference]: Finished difference Result 436 states and 666 transitions. [2024-11-19 10:04:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:17,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-19 10:04:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:17,633 INFO L225 Difference]: With dead ends: 436 [2024-11-19 10:04:17,633 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 10:04:17,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,635 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 54 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:17,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 351 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 10:04:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2024-11-19 10:04:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.52863436123348) internal successors, (347), 230 states have internal predecessors, (347), 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-19 10:04:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2024-11-19 10:04:17,644 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 37 [2024-11-19 10:04:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2024-11-19 10:04:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-19 10:04:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2024-11-19 10:04:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 10:04:17,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:17,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:04:17,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:17,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1345495540, now seen corresponding path program 1 times [2024-11-19 10:04:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128150250] [2024-11-19 10:04:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:17,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:17,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:17,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128150250] [2024-11-19 10:04:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128150250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:17,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:17,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951501209] [2024-11-19 10:04:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:17,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:17,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:17,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,686 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 10:04:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:17,822 INFO L93 Difference]: Finished difference Result 519 states and 792 transitions. [2024-11-19 10:04:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:17,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 10:04:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:17,823 INFO L225 Difference]: With dead ends: 519 [2024-11-19 10:04:17,823 INFO L226 Difference]: Without dead ends: 280 [2024-11-19 10:04:17,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,825 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 78 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:17,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 340 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-19 10:04:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2024-11-19 10:04:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5) internal successors, (402), 271 states have internal predecessors, (402), 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-19 10:04:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 402 transitions. [2024-11-19 10:04:17,832 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 402 transitions. Word has length 38 [2024-11-19 10:04:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,832 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 402 transitions. [2024-11-19 10:04:17,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 10:04:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 402 transitions. [2024-11-19 10:04:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 10:04:17,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:17,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:04:17,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 897739899, now seen corresponding path program 1 times [2024-11-19 10:04:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740983373] [2024-11-19 10:04:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:04:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740983373] [2024-11-19 10:04:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740983373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016444736] [2024-11-19 10:04:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:17,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,873 INFO L87 Difference]: Start difference. First operand 272 states and 402 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-19 10:04:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:17,985 INFO L93 Difference]: Finished difference Result 581 states and 862 transitions. [2024-11-19 10:04:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:17,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 59 [2024-11-19 10:04:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:17,987 INFO L225 Difference]: With dead ends: 581 [2024-11-19 10:04:17,987 INFO L226 Difference]: Without dead ends: 320 [2024-11-19 10:04:17,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:17,988 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 78 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:17,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 310 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-19 10:04:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2024-11-19 10:04:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 308 states have (on average 1.5097402597402598) internal successors, (465), 311 states have internal predecessors, (465), 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-19 10:04:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 465 transitions. [2024-11-19 10:04:17,997 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 465 transitions. Word has length 59 [2024-11-19 10:04:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:17,998 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 465 transitions. [2024-11-19 10:04:17,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-19 10:04:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 465 transitions. [2024-11-19 10:04:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:04:18,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,001 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2024-11-19 10:04:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:04:18,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1683375660, now seen corresponding path program 1 times [2024-11-19 10:04:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483604074] [2024-11-19 10:04:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:04:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483604074] [2024-11-19 10:04:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483604074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129811806] [2024-11-19 10:04:18,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,047 INFO L87 Difference]: Start difference. First operand 312 states and 465 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:18,163 INFO L93 Difference]: Finished difference Result 671 states and 1005 transitions. [2024-11-19 10:04:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 84 [2024-11-19 10:04:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:18,167 INFO L225 Difference]: With dead ends: 671 [2024-11-19 10:04:18,167 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 10:04:18,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,169 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:18,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 395 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 10:04:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 360. [2024-11-19 10:04:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 356 states have (on average 1.4269662921348314) internal successors, (508), 359 states have internal predecessors, (508), 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-19 10:04:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 508 transitions. [2024-11-19 10:04:18,180 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 508 transitions. Word has length 84 [2024-11-19 10:04:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:18,180 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 508 transitions. [2024-11-19 10:04:18,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 508 transitions. [2024-11-19 10:04:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:04:18,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2024-11-19 10:04:18,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:04:18,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 562203794, now seen corresponding path program 1 times [2024-11-19 10:04:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920118484] [2024-11-19 10:04:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:04:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920118484] [2024-11-19 10:04:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920118484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207098491] [2024-11-19 10:04:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,234 INFO L87 Difference]: Start difference. First operand 360 states and 508 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:18,327 INFO L93 Difference]: Finished difference Result 729 states and 1025 transitions. [2024-11-19 10:04:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 84 [2024-11-19 10:04:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:18,329 INFO L225 Difference]: With dead ends: 729 [2024-11-19 10:04:18,329 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 10:04:18,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,330 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:18,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 415 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 10:04:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-19 10:04:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 379 states have (on average 1.4142480211081794) internal successors, (536), 382 states have internal predecessors, (536), 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-19 10:04:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 536 transitions. [2024-11-19 10:04:18,339 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 536 transitions. Word has length 84 [2024-11-19 10:04:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:18,339 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 536 transitions. [2024-11-19 10:04:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 536 transitions. [2024-11-19 10:04:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 10:04:18,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,343 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:04:18,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2069573724, now seen corresponding path program 1 times [2024-11-19 10:04:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970100910] [2024-11-19 10:04:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-19 10:04:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970100910] [2024-11-19 10:04:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970100910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026643536] [2024-11-19 10:04:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,434 INFO L87 Difference]: Start difference. First operand 383 states and 536 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:18,546 INFO L93 Difference]: Finished difference Result 764 states and 1067 transitions. [2024-11-19 10:04:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 99 [2024-11-19 10:04:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:18,547 INFO L225 Difference]: With dead ends: 764 [2024-11-19 10:04:18,547 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 10:04:18,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,548 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:18,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 307 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 10:04:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 386. [2024-11-19 10:04:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 382 states have (on average 1.4136125654450262) internal successors, (540), 385 states have internal predecessors, (540), 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-19 10:04:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 540 transitions. [2024-11-19 10:04:18,557 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 540 transitions. Word has length 99 [2024-11-19 10:04:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:18,558 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 540 transitions. [2024-11-19 10:04:18,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 10:04:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 540 transitions. [2024-11-19 10:04:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 10:04:18,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,560 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 10:04:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:04:18,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1088997587, now seen corresponding path program 1 times [2024-11-19 10:04:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348647112] [2024-11-19 10:04:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-19 10:04:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348647112] [2024-11-19 10:04:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348647112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149014847] [2024-11-19 10:04:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,606 INFO L87 Difference]: Start difference. First operand 386 states and 540 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-19 10:04:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:18,702 INFO L93 Difference]: Finished difference Result 783 states and 1093 transitions. [2024-11-19 10:04:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:18,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 105 [2024-11-19 10:04:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:18,703 INFO L225 Difference]: With dead ends: 783 [2024-11-19 10:04:18,703 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 10:04:18,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,704 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:18,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 414 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 10:04:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2024-11-19 10:04:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 407 states have (on average 1.4004914004914004) internal successors, (570), 410 states have internal predecessors, (570), 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-19 10:04:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 570 transitions. [2024-11-19 10:04:18,713 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 570 transitions. Word has length 105 [2024-11-19 10:04:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:18,714 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 570 transitions. [2024-11-19 10:04:18,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-19 10:04:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 570 transitions. [2024-11-19 10:04:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 10:04:18,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,715 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2024-11-19 10:04:18,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:04:18,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -73613102, now seen corresponding path program 1 times [2024-11-19 10:04:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623464776] [2024-11-19 10:04:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-19 10:04:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623464776] [2024-11-19 10:04:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623464776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186086290] [2024-11-19 10:04:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,770 INFO L87 Difference]: Start difference. First operand 411 states and 570 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:18,866 INFO L93 Difference]: Finished difference Result 835 states and 1157 transitions. [2024-11-19 10:04:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-19 10:04:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:18,869 INFO L225 Difference]: With dead ends: 835 [2024-11-19 10:04:18,869 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 10:04:18,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,870 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:18,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 414 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 10:04:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-19 10:04:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 434 states have (on average 1.3870967741935485) internal successors, (602), 437 states have internal predecessors, (602), 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-19 10:04:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 602 transitions. [2024-11-19 10:04:18,877 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 602 transitions. Word has length 132 [2024-11-19 10:04:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:18,877 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 602 transitions. [2024-11-19 10:04:18,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 602 transitions. [2024-11-19 10:04:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 10:04:18,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:18,878 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2024-11-19 10:04:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:04:18,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 899100067, now seen corresponding path program 1 times [2024-11-19 10:04:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915989474] [2024-11-19 10:04:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:18,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915989474] [2024-11-19 10:04:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915989474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:18,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:18,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604769979] [2024-11-19 10:04:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:18,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:18,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:18,963 INFO L87 Difference]: Start difference. First operand 438 states and 602 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-19 10:04:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:19,079 INFO L93 Difference]: Finished difference Result 901 states and 1237 transitions. [2024-11-19 10:04:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 134 [2024-11-19 10:04:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:19,082 INFO L225 Difference]: With dead ends: 901 [2024-11-19 10:04:19,082 INFO L226 Difference]: Without dead ends: 477 [2024-11-19 10:04:19,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:19,083 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 79 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:19,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 320 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-19 10:04:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 452. [2024-11-19 10:04:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 448 states have (on average 1.3861607142857142) internal successors, (621), 451 states have internal predecessors, (621), 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-19 10:04:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 621 transitions. [2024-11-19 10:04:19,093 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 621 transitions. Word has length 134 [2024-11-19 10:04:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:19,093 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 621 transitions. [2024-11-19 10:04:19,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-19 10:04:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 621 transitions. [2024-11-19 10:04:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 10:04:19,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:19,095 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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] [2024-11-19 10:04:19,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:04:19,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1612556305, now seen corresponding path program 1 times [2024-11-19 10:04:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:19,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072783727] [2024-11-19 10:04:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072783727] [2024-11-19 10:04:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072783727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753192266] [2024-11-19 10:04:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:19,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:19,151 INFO L87 Difference]: Start difference. First operand 452 states and 621 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-19 10:04:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:19,252 INFO L93 Difference]: Finished difference Result 929 states and 1273 transitions. [2024-11-19 10:04:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:19,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 147 [2024-11-19 10:04:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:19,254 INFO L225 Difference]: With dead ends: 929 [2024-11-19 10:04:19,254 INFO L226 Difference]: Without dead ends: 491 [2024-11-19 10:04:19,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:19,255 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 36 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:19,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 420 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-19 10:04:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 473. [2024-11-19 10:04:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 469 states have (on average 1.3795309168443497) internal successors, (647), 472 states have internal predecessors, (647), 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-19 10:04:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 647 transitions. [2024-11-19 10:04:19,263 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 647 transitions. Word has length 147 [2024-11-19 10:04:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:19,263 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 647 transitions. [2024-11-19 10:04:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-19 10:04:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 647 transitions. [2024-11-19 10:04:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-19 10:04:19,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:19,265 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2024-11-19 10:04:19,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:04:19,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:19,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 874643371, now seen corresponding path program 1 times [2024-11-19 10:04:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:19,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208835253] [2024-11-19 10:04:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208835253] [2024-11-19 10:04:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208835253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265810108] [2024-11-19 10:04:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:19,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:19,324 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-19 10:04:19,325 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-19 10:04:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:19,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:19,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:19,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265810108] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:19,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 10:04:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257318582] [2024-11-19 10:04:19,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:04:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:04:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:19,593 INFO L87 Difference]: Start difference. First operand 473 states and 647 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:20,093 INFO L93 Difference]: Finished difference Result 1937 states and 2669 transitions. [2024-11-19 10:04:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:04:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-19 10:04:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:20,098 INFO L225 Difference]: With dead ends: 1937 [2024-11-19 10:04:20,098 INFO L226 Difference]: Without dead ends: 1443 [2024-11-19 10:04:20,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:04:20,100 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 660 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:20,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1091 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:04:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2024-11-19 10:04:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1226. [2024-11-19 10:04:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1222 states have (on average 1.409165302782324) internal successors, (1722), 1225 states have internal predecessors, (1722), 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-19 10:04:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1722 transitions. [2024-11-19 10:04:20,124 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1722 transitions. Word has length 161 [2024-11-19 10:04:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1722 transitions. [2024-11-19 10:04:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1722 transitions. [2024-11-19 10:04:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 10:04:20,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:20,126 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2024-11-19 10:04:20,144 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-19 10:04:20,326 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,SelfDestructingSolverStorable13 [2024-11-19 10:04:20,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1602592893, now seen corresponding path program 1 times [2024-11-19 10:04:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178607718] [2024-11-19 10:04:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178607718] [2024-11-19 10:04:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178607718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34103723] [2024-11-19 10:04:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:20,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:20,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:20,400 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-19 10:04:20,401 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-19 10:04:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:20,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:20,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:20,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 10:04:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34103723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:20,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 10:04:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866141782] [2024-11-19 10:04:20,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:04:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:04:20,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:20,599 INFO L87 Difference]: Start difference. First operand 1226 states and 1722 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-19 10:04:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:21,083 INFO L93 Difference]: Finished difference Result 3500 states and 4827 transitions. [2024-11-19 10:04:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:04:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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 163 [2024-11-19 10:04:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:21,089 INFO L225 Difference]: With dead ends: 3500 [2024-11-19 10:04:21,090 INFO L226 Difference]: Without dead ends: 2288 [2024-11-19 10:04:21,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:04:21,092 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 657 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:21,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1239 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:04:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2024-11-19 10:04:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 1951. [2024-11-19 10:04:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1947 states have (on average 1.3672316384180792) internal successors, (2662), 1950 states have internal predecessors, (2662), 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-19 10:04:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2662 transitions. [2024-11-19 10:04:21,138 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2662 transitions. Word has length 163 [2024-11-19 10:04:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 2662 transitions. [2024-11-19 10:04:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-19 10:04:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2662 transitions. [2024-11-19 10:04:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-19 10:04:21,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:21,140 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:21,154 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-19 10:04:21,341 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,SelfDestructingSolverStorable14 [2024-11-19 10:04:21,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1144734567, now seen corresponding path program 1 times [2024-11-19 10:04:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732460303] [2024-11-19 10:04:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-19 10:04:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732460303] [2024-11-19 10:04:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732460303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002474075] [2024-11-19 10:04:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:21,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,389 INFO L87 Difference]: Start difference. First operand 1951 states and 2662 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-19 10:04:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:21,430 INFO L93 Difference]: Finished difference Result 5058 states and 6904 transitions. [2024-11-19 10:04:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 170 [2024-11-19 10:04:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:21,440 INFO L225 Difference]: With dead ends: 5058 [2024-11-19 10:04:21,440 INFO L226 Difference]: Without dead ends: 3121 [2024-11-19 10:04:21,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,443 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 175 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:21,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2024-11-19 10:04:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2889. [2024-11-19 10:04:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.3729636048526863) internal successors, (3961), 2888 states have internal predecessors, (3961), 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-19 10:04:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3961 transitions. [2024-11-19 10:04:21,513 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3961 transitions. Word has length 170 [2024-11-19 10:04:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 3961 transitions. [2024-11-19 10:04:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-19 10:04:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3961 transitions. [2024-11-19 10:04:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-19 10:04:21,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:21,515 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 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] [2024-11-19 10:04:21,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:04:21,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:21,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1309139441, now seen corresponding path program 1 times [2024-11-19 10:04:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483652488] [2024-11-19 10:04:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-19 10:04:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:21,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483652488] [2024-11-19 10:04:21,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483652488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:21,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750246849] [2024-11-19 10:04:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:21,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:21,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,568 INFO L87 Difference]: Start difference. First operand 2889 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-19 10:04:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:21,687 INFO L93 Difference]: Finished difference Result 5283 states and 7197 transitions. [2024-11-19 10:04:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 172 [2024-11-19 10:04:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:21,694 INFO L225 Difference]: With dead ends: 5283 [2024-11-19 10:04:21,694 INFO L226 Difference]: Without dead ends: 2408 [2024-11-19 10:04:21,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,699 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:21,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 401 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-11-19 10:04:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1683. [2024-11-19 10:04:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1681 states have (on average 1.3337299226650803) internal successors, (2242), 1682 states have internal predecessors, (2242), 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-19 10:04:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2242 transitions. [2024-11-19 10:04:21,736 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2242 transitions. Word has length 172 [2024-11-19 10:04:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2242 transitions. [2024-11-19 10:04:21,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-19 10:04:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2242 transitions. [2024-11-19 10:04:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-19 10:04:21,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:21,739 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:04:21,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 906405431, now seen corresponding path program 1 times [2024-11-19 10:04:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135319016] [2024-11-19 10:04:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-19 10:04:21,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135319016] [2024-11-19 10:04:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135319016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349968234] [2024-11-19 10:04:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,798 INFO L87 Difference]: Start difference. First operand 1683 states and 2242 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-19 10:04:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:21,921 INFO L93 Difference]: Finished difference Result 3335 states and 4438 transitions. [2024-11-19 10:04:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:21,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 206 [2024-11-19 10:04:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:21,928 INFO L225 Difference]: With dead ends: 3335 [2024-11-19 10:04:21,928 INFO L226 Difference]: Without dead ends: 1666 [2024-11-19 10:04:21,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:21,930 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:21,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 349 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-19 10:04:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1659. [2024-11-19 10:04:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1657 states have (on average 1.3174411587205794) internal successors, (2183), 1658 states have internal predecessors, (2183), 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-19 10:04:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2183 transitions. [2024-11-19 10:04:21,960 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2183 transitions. Word has length 206 [2024-11-19 10:04:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2183 transitions. [2024-11-19 10:04:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-19 10:04:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2183 transitions. [2024-11-19 10:04:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-19 10:04:21,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:21,963 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 10:04:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:04:21,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1868556935, now seen corresponding path program 1 times [2024-11-19 10:04:21,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:21,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814711909] [2024-11-19 10:04:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-19 10:04:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814711909] [2024-11-19 10:04:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814711909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:22,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186351721] [2024-11-19 10:04:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:22,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:22,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,022 INFO L87 Difference]: Start difference. First operand 1659 states and 2183 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:22,130 INFO L93 Difference]: Finished difference Result 2844 states and 3696 transitions. [2024-11-19 10:04:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 208 [2024-11-19 10:04:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:22,133 INFO L225 Difference]: With dead ends: 2844 [2024-11-19 10:04:22,133 INFO L226 Difference]: Without dead ends: 736 [2024-11-19 10:04:22,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,136 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 28 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:22,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 402 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-19 10:04:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 724. [2024-11-19 10:04:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 722 states have (on average 1.3019390581717452) internal successors, (940), 723 states have internal predecessors, (940), 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-19 10:04:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 940 transitions. [2024-11-19 10:04:22,150 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 940 transitions. Word has length 208 [2024-11-19 10:04:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:22,150 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 940 transitions. [2024-11-19 10:04:22,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 940 transitions. [2024-11-19 10:04:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-19 10:04:22,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:22,152 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:22,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:04:22,154 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash 377591015, now seen corresponding path program 1 times [2024-11-19 10:04:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938437564] [2024-11-19 10:04:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-11-19 10:04:22,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938437564] [2024-11-19 10:04:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938437564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389794757] [2024-11-19 10:04:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,214 INFO L87 Difference]: Start difference. First operand 724 states and 940 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-19 10:04:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:22,311 INFO L93 Difference]: Finished difference Result 1536 states and 1984 transitions. [2024-11-19 10:04:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:22,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 306 [2024-11-19 10:04:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:22,315 INFO L225 Difference]: With dead ends: 1536 [2024-11-19 10:04:22,315 INFO L226 Difference]: Without dead ends: 826 [2024-11-19 10:04:22,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,318 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:22,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-19 10:04:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2024-11-19 10:04:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 824 states have (on average 1.2827669902912622) internal successors, (1057), 825 states have internal predecessors, (1057), 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-19 10:04:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1057 transitions. [2024-11-19 10:04:22,344 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1057 transitions. Word has length 306 [2024-11-19 10:04:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:22,344 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1057 transitions. [2024-11-19 10:04:22,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-19 10:04:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1057 transitions. [2024-11-19 10:04:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-19 10:04:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:22,347 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:22,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 10:04:22,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1817503023, now seen corresponding path program 1 times [2024-11-19 10:04:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531964408] [2024-11-19 10:04:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-19 10:04:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:22,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531964408] [2024-11-19 10:04:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531964408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:22,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382384586] [2024-11-19 10:04:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:22,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,418 INFO L87 Difference]: Start difference. First operand 826 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-19 10:04:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:22,517 INFO L93 Difference]: Finished difference Result 1746 states and 2230 transitions. [2024-11-19 10:04:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 337 [2024-11-19 10:04:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:22,521 INFO L225 Difference]: With dead ends: 1746 [2024-11-19 10:04:22,521 INFO L226 Difference]: Without dead ends: 934 [2024-11-19 10:04:22,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,523 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:22,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-19 10:04:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-11-19 10:04:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 932 states have (on average 1.2660944206008584) internal successors, (1180), 933 states have internal predecessors, (1180), 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-19 10:04:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1180 transitions. [2024-11-19 10:04:22,540 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1180 transitions. Word has length 337 [2024-11-19 10:04:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:22,541 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1180 transitions. [2024-11-19 10:04:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-19 10:04:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1180 transitions. [2024-11-19 10:04:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-19 10:04:22,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:22,544 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 10:04:22,544 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:22,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 833831308, now seen corresponding path program 1 times [2024-11-19 10:04:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257341107] [2024-11-19 10:04:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-19 10:04:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257341107] [2024-11-19 10:04:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257341107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:22,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:22,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548500490] [2024-11-19 10:04:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:22,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,614 INFO L87 Difference]: Start difference. First operand 934 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-19 10:04:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:22,716 INFO L93 Difference]: Finished difference Result 1853 states and 2336 transitions. [2024-11-19 10:04:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 370 [2024-11-19 10:04:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:22,719 INFO L225 Difference]: With dead ends: 1853 [2024-11-19 10:04:22,719 INFO L226 Difference]: Without dead ends: 933 [2024-11-19 10:04:22,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,721 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:22,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-19 10:04:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 709. [2024-11-19 10:04:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 707 states have (on average 1.28005657708628) internal successors, (905), 708 states have internal predecessors, (905), 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-19 10:04:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 905 transitions. [2024-11-19 10:04:22,733 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 905 transitions. Word has length 370 [2024-11-19 10:04:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 905 transitions. [2024-11-19 10:04:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-19 10:04:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 905 transitions. [2024-11-19 10:04:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 10:04:22,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:22,737 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:04:22,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 10:04:22,738 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:22,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash -224580578, now seen corresponding path program 1 times [2024-11-19 10:04:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94050074] [2024-11-19 10:04:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2024-11-19 10:04:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94050074] [2024-11-19 10:04:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94050074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:22,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:22,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543227638] [2024-11-19 10:04:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:22,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,885 INFO L87 Difference]: Start difference. First operand 709 states and 905 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-19 10:04:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:22,908 INFO L93 Difference]: Finished difference Result 1836 states and 2319 transitions. [2024-11-19 10:04:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 408 [2024-11-19 10:04:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:22,912 INFO L225 Difference]: With dead ends: 1836 [2024-11-19 10:04:22,912 INFO L226 Difference]: Without dead ends: 1141 [2024-11-19 10:04:22,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:22,913 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 94 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:22,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 477 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-11-19 10:04:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2024-11-19 10:04:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1139 states have (on average 1.257243195785777) internal successors, (1432), 1140 states have internal predecessors, (1432), 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-19 10:04:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1432 transitions. [2024-11-19 10:04:22,931 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1432 transitions. Word has length 408 [2024-11-19 10:04:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:22,931 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1432 transitions. [2024-11-19 10:04:22,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-19 10:04:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1432 transitions. [2024-11-19 10:04:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 10:04:22,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:22,935 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:04:22,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 10:04:22,935 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:04:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 64238812, now seen corresponding path program 1 times [2024-11-19 10:04:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459552181] [2024-11-19 10:04:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2024-11-19 10:04:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459552181] [2024-11-19 10:04:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459552181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535951218] [2024-11-19 10:04:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:23,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:23,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:23,063 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-19 10:04:23,064 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-19 10:04:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:23,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:23,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2024-11-19 10:04:23,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2024-11-19 10:04:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535951218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:23,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-19 10:04:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459527556] [2024-11-19 10:04:23,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:23,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:04:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:04:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:04:23,299 INFO L87 Difference]: Start difference. First operand 1141 states and 1432 transitions. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 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-19 10:04:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:23,457 INFO L93 Difference]: Finished difference Result 2133 states and 2654 transitions. [2024-11-19 10:04:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 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 408 [2024-11-19 10:04:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:23,458 INFO L225 Difference]: With dead ends: 2133 [2024-11-19 10:04:23,458 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:04:23,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:04:23,460 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 86 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 753 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:04:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:04:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:04:23,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2024-11-19 10:04:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:23,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:04:23,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 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-19 10:04:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:04:23,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:04:23,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:04:23,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:04:23,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:04:23,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:04:23,482 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-19 10:04:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:23,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:23,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:04:24,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:04:24,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:24 BoogieIcfgContainer [2024-11-19 10:04:24,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:04:24,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:04:24,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:04:24,292 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:04:24,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:16" (3/4) ... [2024-11-19 10:04:24,296 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:04:24,310 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-19 10:04:24,311 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:04:24,312 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:04:24,312 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:04:24,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:04:24,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:04:24,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:04:24,431 INFO L158 Benchmark]: Toolchain (without parser) took 9284.80ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 123.0MB in the beginning and 180.5MB in the end (delta: -57.5MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,432 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 94.1MB in the end (delta: 126.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:04:24,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.32ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 104.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.15ms. Allocated memory is still 157.3MB. Free memory was 104.3MB in the beginning and 100.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,432 INFO L158 Benchmark]: Boogie Preprocessor took 50.66ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 97.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,432 INFO L158 Benchmark]: RCFGBuilder took 700.17ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 102.2MB in the end (delta: -4.8MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,434 INFO L158 Benchmark]: TraceAbstraction took 7965.34ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 101.1MB in the beginning and 192.0MB in the end (delta: -90.9MB). Peak memory consumption was 162.3MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,434 INFO L158 Benchmark]: Witness Printer took 139.20ms. Allocated memory is still 293.6MB. Free memory was 192.0MB in the beginning and 180.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:04:24,435 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.18ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 94.1MB in the end (delta: 126.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.32ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 104.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.15ms. Allocated memory is still 157.3MB. Free memory was 104.3MB in the beginning and 100.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.66ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 97.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 700.17ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 102.2MB in the end (delta: -4.8MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7965.34ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 101.1MB in the beginning and 192.0MB in the end (delta: -90.9MB). Peak memory consumption was 162.3MB. Max. memory is 16.1GB. * Witness Printer took 139.20ms. Allocated memory is still 293.6MB. Free memory was 192.0MB in the beginning and 180.5MB in the end (delta: 11.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 - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 24, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2476 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2476 mSDsluCounter, 11306 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5169 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3769 IncrementalHoareTripleChecker+Invalid, 4217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 6137 mSDtfsCounter, 3769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1551 GetRequests, 1507 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2889occurred in iteration=16, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1862 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4620 NumberOfCodeBlocks, 4620 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5322 ConstructedInterpolants, 0 QuantifiedInterpolants, 7310 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1327 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 30 InterpolantComputations, 21 PerfectInterpolantSequences, 14247/14304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((s__state == 8528) || ((s__s3__tmp__next_state___0 <= 8576) && (s__state == 8640))) || (8496 == s__state)) || ((8576 == s__s3__tmp__next_state___0) && (8576 == s__state))) || ((s__state == 8592) && (s__s3__tmp__next_state___0 <= 8576))) || (8560 == s__state)) || ((s__state == 8608) && (s__s3__tmp__next_state___0 <= 8576))) || (((((s__state <= 12291) && (8576 <= s__s3__tmp__next_state___0)) && (0 != s__hit)) && (8576 <= s__state)) && (s__s3__tmp__next_state___0 <= 12291))) || (((8576 == s__s3__tmp__next_state___0) && (s__state <= 8466)) && (8448 <= s__state))) || (s__state == 8512)) || ((s__state == 3) && (s__s3__tmp__next_state___0 <= 8576))) || (((((s__state <= 8466) && (8576 <= s__s3__tmp__next_state___0)) && (8448 <= s__state)) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || (8464 == s__state)) || ((3 == s__s3__tmp__next_state___0) && (8448 == s__state))) || (((s__state == 3) && (0 != s__hit)) && (s__s3__tmp__next_state___0 <= 12291))) || ((8656 <= s__state) && (s__state <= 8672))) || (8544 == s__state)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:04:24,462 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 Result: TRUE