./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/b.11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/b.11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 5b4c99d0b33a566b40cf4365ddd1611945e8961cf9631a2c233f1ae25de30e8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:14:11,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:14:11,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:14:11,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:14:11,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:14:11,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:14:11,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:14:11,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:14:11,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:14:11,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:14:11,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:14:11,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:14:11,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:14:11,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:14:11,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:14:11,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:14:11,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:14:11,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:14:11,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:14:11,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:14:11,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:14:11,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:14:11,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:14:11,355 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:14:11,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:14:11,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:14:11,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:14:11,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:14:11,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:14:11,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:14:11,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:14:11,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:14:11,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:14:11,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:14:11,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:14:11,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:14:11,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:14:11,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:14:11,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:14:11,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:14:11,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:14:11,373 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4c99d0b33a566b40cf4365ddd1611945e8961cf9631a2c233f1ae25de30e8d [2024-11-19 10:14:11,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:14:11,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:14:11,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:14:11,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:14:11,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:14:11,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/b.11.c [2024-11-19 10:14:13,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:14:13,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:14:13,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.11.c [2024-11-19 10:14:13,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882276d5/c6ec1a9d80574ff98a78a0b1dd0158c8/FLAG0e926dcad [2024-11-19 10:14:13,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882276d5/c6ec1a9d80574ff98a78a0b1dd0158c8 [2024-11-19 10:14:13,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:14:13,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:14:13,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:14:13,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:14:13,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:14:13,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fb078b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13, skipping insertion in model container [2024-11-19 10:14:13,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:14:13,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:14:13,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:14:13,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:14:13,652 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:14:13,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13 WrapperNode [2024-11-19 10:14:13,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:14:13,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:14:13,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:14:13,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:14:13,660 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:14:13" (1/1) ... [2024-11-19 10:14:13,664 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:14:13" (1/1) ... [2024-11-19 10:14:13,680 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-19 10:14:13,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:14:13,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:14:13,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:14:13,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:14:13,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,696 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:14:13,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:14:13,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:14:13,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:14:13,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:14:13,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (1/1) ... [2024-11-19 10:14:13,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:14:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:14:13,745 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:14:13,751 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:14:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:14:13,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:14:13,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:14:13,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:14:14,063 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 10:14:14,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:14:14,078 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:14:14,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:14:14,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:14:14 BoogieIcfgContainer [2024-11-19 10:14:14,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:14:14,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:14:14,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:14:14,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:14:14,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:14:13" (1/3) ... [2024-11-19 10:14:14,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0224ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:14:14, skipping insertion in model container [2024-11-19 10:14:14,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:14:13" (2/3) ... [2024-11-19 10:14:14,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0224ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:14:14, skipping insertion in model container [2024-11-19 10:14:14,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:14:14" (3/3) ... [2024-11-19 10:14:14,094 INFO L112 eAbstractionObserver]: Analyzing ICFG b.11.c [2024-11-19 10:14:14,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:14:14,111 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-19 10:14:14,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:14:14,168 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;@21bb1a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:14:14,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 10:14:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:14:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:14:14,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:14,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:14:14,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:14,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 28695781, now seen corresponding path program 1 times [2024-11-19 10:14:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833689819] [2024-11-19 10:14:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:14,344 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:14:14,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833689819] [2024-11-19 10:14:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833689819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:14,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:14:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644532048] [2024-11-19 10:14:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:14:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:14:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:14:14,370 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:14:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:14,436 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-19 10:14:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:14:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-19 10:14:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:14,447 INFO L225 Difference]: With dead ends: 45 [2024-11-19 10:14:14,448 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 10:14:14,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:14:14,455 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:14,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 10:14:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 10:14:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 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:14:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-19 10:14:14,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 5 [2024-11-19 10:14:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-19 10:14:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:14:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-19 10:14:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:14:14,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:14,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:14:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:14:14,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 889569255, now seen corresponding path program 1 times [2024-11-19 10:14:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330992223] [2024-11-19 10:14:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:14,551 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:14:14,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330992223] [2024-11-19 10:14:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330992223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:14,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:14:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734932177] [2024-11-19 10:14:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:14:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:14,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:14:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:14,582 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:14:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:14,755 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-19 10:14:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:14:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-19 10:14:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:14,757 INFO L225 Difference]: With dead ends: 59 [2024-11-19 10:14:14,757 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 10:14:14,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:14,758 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:14,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 73 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:14:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 10:14:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-19 10:14:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 50 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:14:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-19 10:14:14,777 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 6 [2024-11-19 10:14:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:14,778 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-19 10:14:14,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:14:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-19 10:14:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:14:14,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:14,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:14,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:14:14,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1387049590, now seen corresponding path program 1 times [2024-11-19 10:14:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506587394] [2024-11-19 10:14:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:14,830 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:14:14,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506587394] [2024-11-19 10:14:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506587394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349387598] [2024-11-19 10:14:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:14:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:14:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:14,834 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:14:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:14,865 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2024-11-19 10:14:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:14:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-19 10:14:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:14,868 INFO L225 Difference]: With dead ends: 102 [2024-11-19 10:14:14,868 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 10:14:14,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:14,871 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:14,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 10:14:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 10:14:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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:14:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-11-19 10:14:14,880 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 9 [2024-11-19 10:14:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-19 10:14:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:14:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-19 10:14:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:14:14,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:14,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:14:14,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1387099210, now seen corresponding path program 1 times [2024-11-19 10:14:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376690777] [2024-11-19 10:14:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:14,955 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:14:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376690777] [2024-11-19 10:14:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376690777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:14:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125433430] [2024-11-19 10:14:14,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:14:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:14:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:14:14,960 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:14:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:15,032 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2024-11-19 10:14:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:14:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-19 10:14:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:15,034 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:14:15,034 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 10:14:15,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:14:15,038 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:15,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 10:14:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-19 10:14:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.492063492063492) internal successors, (94), 69 states have internal predecessors, (94), 0 states have call successors, (0), 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:14:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2024-11-19 10:14:15,047 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 9 [2024-11-19 10:14:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2024-11-19 10:14:15,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:14:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2024-11-19 10:14:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:14:15,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:15,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:15,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:14:15,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:15,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1568206898, now seen corresponding path program 1 times [2024-11-19 10:14:15,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:15,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508169169] [2024-11-19 10:14:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:15,143 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:14:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508169169] [2024-11-19 10:14:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508169169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:15,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:14:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053376577] [2024-11-19 10:14:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:15,145 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:14:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:15,258 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2024-11-19 10:14:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:15,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-19 10:14:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:15,260 INFO L225 Difference]: With dead ends: 165 [2024-11-19 10:14:15,260 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 10:14:15,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:14:15,261 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:15,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 85 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 10:14:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-19 10:14:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 92 states have internal predecessors, (122), 0 states have call successors, (0), 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:14:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-11-19 10:14:15,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 11 [2024-11-19 10:14:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:15,277 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-11-19 10:14:15,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:14:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-11-19 10:14:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:14:15,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:15,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:15,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:14:15,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:15,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1599754246, now seen corresponding path program 1 times [2024-11-19 10:14:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:15,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411044860] [2024-11-19 10:14:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:15,336 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:14:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411044860] [2024-11-19 10:14:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411044860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:14:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082417838] [2024-11-19 10:14:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:14:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:15,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:14:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:15,338 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:14:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:15,446 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2024-11-19 10:14:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:15,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-19 10:14:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:15,448 INFO L225 Difference]: With dead ends: 185 [2024-11-19 10:14:15,448 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 10:14:15,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:15,450 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 64 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:15,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 59 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 10:14:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 116. [2024-11-19 10:14:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 115 states have internal predecessors, (153), 0 states have call successors, (0), 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:14:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 153 transitions. [2024-11-19 10:14:15,462 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 153 transitions. Word has length 11 [2024-11-19 10:14:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:15,462 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 153 transitions. [2024-11-19 10:14:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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:14:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 153 transitions. [2024-11-19 10:14:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:14:15,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:15,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:14:15,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:15,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1947225999, now seen corresponding path program 1 times [2024-11-19 10:14:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237391545] [2024-11-19 10:14:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:15,552 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:14:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237391545] [2024-11-19 10:14:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237391545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432178617] [2024-11-19 10:14:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:15,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:15,554 INFO L87 Difference]: Start difference. First operand 116 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:14:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:15,652 INFO L93 Difference]: Finished difference Result 205 states and 277 transitions. [2024-11-19 10:14:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-19 10:14:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:15,654 INFO L225 Difference]: With dead ends: 205 [2024-11-19 10:14:15,654 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 10:14:15,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:15,655 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:15,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 10:14:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-19 10:14:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.385786802030457) internal successors, (273), 203 states have internal predecessors, (273), 0 states have call successors, (0), 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:14:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2024-11-19 10:14:15,670 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 12 [2024-11-19 10:14:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:15,674 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2024-11-19 10:14:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:14:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2024-11-19 10:14:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:14:15,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:15,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:15,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:14:15,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:15,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1694214290, now seen corresponding path program 1 times [2024-11-19 10:14:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066348303] [2024-11-19 10:14:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:15,799 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:14:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066348303] [2024-11-19 10:14:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066348303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:14:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605907590] [2024-11-19 10:14:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:14:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:14:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:14:15,802 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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:14:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:15,898 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-19 10:14:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:14:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-19 10:14:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:15,902 INFO L225 Difference]: With dead ends: 221 [2024-11-19 10:14:15,902 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 10:14:15,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:14:15,903 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:15,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 10:14:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 207. [2024-11-19 10:14:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.355) internal successors, (271), 206 states have internal predecessors, (271), 0 states have call successors, (0), 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:14:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 271 transitions. [2024-11-19 10:14:15,940 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 271 transitions. Word has length 13 [2024-11-19 10:14:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 271 transitions. [2024-11-19 10:14:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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:14:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 271 transitions. [2024-11-19 10:14:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:14:15,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:15,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:15,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:14:15,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -981035365, now seen corresponding path program 1 times [2024-11-19 10:14:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858230109] [2024-11-19 10:14:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,012 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:14:16,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858230109] [2024-11-19 10:14:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858230109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557292807] [2024-11-19 10:14:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,016 INFO L87 Difference]: Start difference. First operand 207 states and 271 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,114 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2024-11-19 10:14:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:16,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-19 10:14:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,118 INFO L225 Difference]: With dead ends: 208 [2024-11-19 10:14:16,118 INFO L226 Difference]: Without dead ends: 206 [2024-11-19 10:14:16,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:14:16,122 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-19 10:14:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2024-11-19 10:14:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.3125) internal successors, (210), 165 states have internal predecessors, (210), 0 states have call successors, (0), 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:14:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2024-11-19 10:14:16,137 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 14 [2024-11-19 10:14:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,138 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2024-11-19 10:14:16,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2024-11-19 10:14:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:14:16,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:14:16,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1315697474, now seen corresponding path program 1 times [2024-11-19 10:14:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019295237] [2024-11-19 10:14:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,162 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:14:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019295237] [2024-11-19 10:14:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019295237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:14:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205439324] [2024-11-19 10:14:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:14:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:14:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:14:16,165 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,181 INFO L93 Difference]: Finished difference Result 325 states and 408 transitions. [2024-11-19 10:14:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:14:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-19 10:14:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,183 INFO L225 Difference]: With dead ends: 325 [2024-11-19 10:14:16,183 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:14:16,184 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:14:16,184 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:14:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 10:14:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 155 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:14:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 188 transitions. [2024-11-19 10:14:16,195 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 188 transitions. Word has length 14 [2024-11-19 10:14:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,196 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 188 transitions. [2024-11-19 10:14:16,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2024-11-19 10:14:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:14:16,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:14:16,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 334166611, now seen corresponding path program 1 times [2024-11-19 10:14:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513582990] [2024-11-19 10:14:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,248 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:14:16,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513582990] [2024-11-19 10:14:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513582990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:14:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672492032] [2024-11-19 10:14:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,252 INFO L87 Difference]: Start difference. First operand 156 states and 188 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,280 INFO L93 Difference]: Finished difference Result 303 states and 363 transitions. [2024-11-19 10:14:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-19 10:14:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,282 INFO L225 Difference]: With dead ends: 303 [2024-11-19 10:14:16,282 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:14:16,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,285 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:14:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 10:14:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 155 states have internal predecessors, (184), 0 states have call successors, (0), 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:14:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2024-11-19 10:14:16,293 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 14 [2024-11-19 10:14:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,293 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2024-11-19 10:14:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:14:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2024-11-19 10:14:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:14:16,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:14:16,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1297490010, now seen corresponding path program 1 times [2024-11-19 10:14:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215293485] [2024-11-19 10:14:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,344 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:14:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215293485] [2024-11-19 10:14:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215293485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627855197] [2024-11-19 10:14:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:16,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,346 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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:14:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,429 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2024-11-19 10:14:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:14:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 10:14:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,431 INFO L225 Difference]: With dead ends: 217 [2024-11-19 10:14:16,431 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 10:14:16,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:14:16,432 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 36 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 10:14:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 155. [2024-11-19 10:14:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 0 states have call successors, (0), 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:14:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2024-11-19 10:14:16,444 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 16 [2024-11-19 10:14:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,444 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2024-11-19 10:14:16,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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:14:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2024-11-19 10:14:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:14:16,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:14:16,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 233008023, now seen corresponding path program 1 times [2024-11-19 10:14:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818760927] [2024-11-19 10:14:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,473 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:14:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818760927] [2024-11-19 10:14:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818760927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32199293] [2024-11-19 10:14:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:14:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:14:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:16,475 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:14:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,526 INFO L93 Difference]: Finished difference Result 227 states and 262 transitions. [2024-11-19 10:14:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:14:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-19 10:14:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,527 INFO L225 Difference]: With dead ends: 227 [2024-11-19 10:14:16,527 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 10:14:16,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,529 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 55 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 10:14:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-19 10:14:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 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:14:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-11-19 10:14:16,534 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 16 [2024-11-19 10:14:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,535 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-11-19 10:14:16,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:14:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-11-19 10:14:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:14:16,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:14:16,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1227971096, now seen corresponding path program 1 times [2024-11-19 10:14:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538522161] [2024-11-19 10:14:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,575 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:14:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538522161] [2024-11-19 10:14:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538522161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:14:16,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095760842] [2024-11-19 10:14:16,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:14:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:14:16,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:14:16,579 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:14:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,650 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-19 10:14:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-19 10:14:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,651 INFO L225 Difference]: With dead ends: 120 [2024-11-19 10:14:16,651 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 10:14:16,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,652 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 46 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 10:14:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-11-19 10:14:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.18348623853211) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 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:14:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-19 10:14:16,657 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 17 [2024-11-19 10:14:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-19 10:14:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:14:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-19 10:14:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:14:16,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:14:16,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -587595610, now seen corresponding path program 1 times [2024-11-19 10:14:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112787024] [2024-11-19 10:14:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,706 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:14:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112787024] [2024-11-19 10:14:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112787024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695057093] [2024-11-19 10:14:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:16,708 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:14:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:16,770 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-11-19 10:14:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:14:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 10:14:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:16,771 INFO L225 Difference]: With dead ends: 129 [2024-11-19 10:14:16,771 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 10:14:16,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:14:16,772 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:16,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 10:14:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 69. [2024-11-19 10:14:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 68 states have internal predecessors, (77), 0 states have call successors, (0), 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:14:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-19 10:14:16,778 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 18 [2024-11-19 10:14:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:16,779 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-19 10:14:16,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:14:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-19 10:14:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:14:16,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:16,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:14:16,780 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1066462104, now seen corresponding path program 1 times [2024-11-19 10:14:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909493138] [2024-11-19 10:14:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:14:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909493138] [2024-11-19 10:14:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909493138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:14:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552373713] [2024-11-19 10:14:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:14:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:14:16,826 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:14:16,828 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:14:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:16,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:14:16,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:14:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:14:16,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:14:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552373713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:14:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 6 [2024-11-19 10:14:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213823609] [2024-11-19 10:14:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:14:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:14:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:14:16,993 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:14:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:17,116 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-19 10:14:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:14:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-19 10:14:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:17,117 INFO L225 Difference]: With dead ends: 88 [2024-11-19 10:14:17,117 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 10:14:17,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:14:17,118 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:17,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 63 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:14:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 10:14:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-19 10:14:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 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:14:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-19 10:14:17,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2024-11-19 10:14:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:17,122 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-19 10:14:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:14:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-19 10:14:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:14:17,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:14:17,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:17,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 10:14:17,329 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,SelfDestructingSolverStorable15 [2024-11-19 10:14:17,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-19 10:14:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:14:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -154397489, now seen corresponding path program 1 times [2024-11-19 10:14:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:14:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28631590] [2024-11-19 10:14:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:14:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:14:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:14:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:14:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:14:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28631590] [2024-11-19 10:14:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28631590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:14:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:14:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:14:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313940096] [2024-11-19 10:14:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:14:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:14:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:14:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:14:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:14:17,403 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:14:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:14:17,451 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-11-19 10:14:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:14:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-19 10:14:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:14:17,452 INFO L225 Difference]: With dead ends: 47 [2024-11-19 10:14:17,452 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:14:17,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:14:17,453 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:14:17,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:14:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:14:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:14:17,454 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:14:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:14:17,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-19 10:14:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:14:17,454 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:14:17,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:14:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:14:17,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:14:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-19 10:14:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-19 10:14:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-19 10:14:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-19 10:14:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-19 10:14:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-19 10:14:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-19 10:14:17,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:14:17,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:14:17,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:14:17,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:14:17,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:14:17 BoogieIcfgContainer [2024-11-19 10:14:17,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:14:17,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:14:17,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:14:17,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:14:17,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:14:14" (3/4) ... [2024-11-19 10:14:17,585 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:14:17,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 10:14:17,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:14:17,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 10:14:17,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:14:17,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:14:17,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:14:17,683 INFO L158 Benchmark]: Toolchain (without parser) took 4255.97ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 121.1MB in the beginning and 158.1MB in the end (delta: -37.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,683 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 125.0MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.04ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 109.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.18ms. Allocated memory is still 157.3MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,684 INFO L158 Benchmark]: Boogie Preprocessor took 24.09ms. Allocated memory is still 157.3MB. Free memory was 108.1MB in the beginning and 106.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,684 INFO L158 Benchmark]: RCFGBuilder took 373.37ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 94.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,684 INFO L158 Benchmark]: TraceAbstraction took 3500.64ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 93.9MB in the beginning and 163.3MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:14:17,685 INFO L158 Benchmark]: Witness Printer took 100.48ms. Allocated memory is still 218.1MB. Free memory was 162.3MB in the beginning and 158.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:14:17,687 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.25ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 125.0MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.04ms. Allocated memory is still 157.3MB. Free memory was 120.7MB in the beginning and 109.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.18ms. Allocated memory is still 157.3MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.09ms. Allocated memory is still 157.3MB. Free memory was 108.1MB in the beginning and 106.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.37ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 94.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3500.64ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 93.9MB in the beginning and 163.3MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 100.48ms. Allocated memory is still 218.1MB. Free memory was 162.3MB in the beginning and 158.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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, 41 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 945 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 452 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=8, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 269 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 1 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 15/17 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 12 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((x <= 2147483647) && (0 <= (x + 2147483648))) && (0 <= (y + 2147483648))) && (y <= 2147483647)) || (((0 <= ((long) x + 2147483646)) && (y <= 2147483647)) && (((long) x + 1) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:14:17,717 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