./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:20:31,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:20:31,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:20:31,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:20:31,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:20:31,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:20:31,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:20:31,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:20:31,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:20:31,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:20:31,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:20:31,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:20:31,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:20:31,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:20:31,560 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:20:31,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:20:31,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:20:31,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:20:31,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:20:31,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:20:31,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:20:31,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:20:31,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:20:31,565 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:20:31,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:20:31,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:20:31,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:20:31,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:20:31,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:20:31,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:20:31,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:20:31,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:20:31,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:20:31,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:20:31,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:20:31,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:20:31,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:20:31,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:20:31,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:20:31,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:20:31,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:20:31,570 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-clean/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-clean/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 -> 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 [2024-10-11 20:20:31,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:20:31,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:20:31,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:20:31,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:20:31,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:20:31,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-10-11 20:20:33,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:20:33,415 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:20:33,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-10-11 20:20:33,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54cc91b2b/04c8c542a43f41e78201172169a2c013/FLAG866cfbad5 [2024-10-11 20:20:33,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54cc91b2b/04c8c542a43f41e78201172169a2c013 [2024-10-11 20:20:33,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:20:33,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:20:33,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:20:33,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:20:33,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:20:33,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1252ac11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33, skipping insertion in model container [2024-10-11 20:20:33,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:20:33,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:20:33,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:20:33,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:20:33,665 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:20:33,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33 WrapperNode [2024-10-11 20:20:33,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:20:33,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:20:33,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:20:33,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:20:33,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,699 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-10-11 20:20:33,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:20:33,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:20:33,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:20:33,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:20:33,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,718 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:20:33,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:20:33,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:20:33,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:20:33,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:20:33,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (1/1) ... [2024-10-11 20:20:33,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:20:33,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:33,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:20:33,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:20:33,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:20:33,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:20:33,863 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:20:33,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:20:33,934 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 20:20:33,935 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:20:33,952 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:20:33,952 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:20:33,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:20:33 BoogieIcfgContainer [2024-10-11 20:20:33,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:20:33,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:20:33,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:20:33,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:20:33,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:20:33" (1/3) ... [2024-10-11 20:20:33,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd63441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:20:33, skipping insertion in model container [2024-10-11 20:20:33,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:20:33" (2/3) ... [2024-10-11 20:20:33,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd63441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:20:33, skipping insertion in model container [2024-10-11 20:20:33,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:20:33" (3/3) ... [2024-10-11 20:20:33,961 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Nested.c [2024-10-11 20:20:33,985 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:20:33,986 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 20:20:34,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:20:34,047 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;@25f5cd8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:20:34,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 20:20:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 2.0) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-11 20:20:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:20:34,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:20:34,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2364654, now seen corresponding path program 1 times [2024-10-11 20:20:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129056232] [2024-10-11 20:20:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129056232] [2024-10-11 20:20:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129056232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:20:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916657078] [2024-10-11 20:20:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,270 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 2.0) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,347 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-10-11 20:20:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:20:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,361 INFO L225 Difference]: With dead ends: 50 [2024-10-11 20:20:34,362 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:20:34,365 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-10-11 20:20:34,370 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:20:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 20:20:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-11 20:20:34,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 4 [2024-10-11 20:20:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,403 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-11 20:20:34,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-11 20:20:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:20:34,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:20:34,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:20:34,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2364701, now seen corresponding path program 1 times [2024-10-11 20:20:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125389228] [2024-10-11 20:20:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125389228] [2024-10-11 20:20:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125389228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:20:34,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402947109] [2024-10-11 20:20:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,457 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,487 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-11 20:20:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:20:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,488 INFO L225 Difference]: With dead ends: 27 [2024-10-11 20:20:34,489 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 20:20:34,489 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-10-11 20:20:34,491 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 20:20:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 20:20:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-11 20:20:34,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 4 [2024-10-11 20:20:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,500 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-11 20:20:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-11 20:20:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:20:34,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:20:34,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2022487905, now seen corresponding path program 1 times [2024-10-11 20:20:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174099404] [2024-10-11 20:20:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174099404] [2024-10-11 20:20:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174099404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517911036] [2024-10-11 20:20:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,566 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10-11 20:20:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,583 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-11 20:20:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10-11 20:20:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,585 INFO L225 Difference]: With dead ends: 26 [2024-10-11 20:20:34,585 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 20:20:34,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 20:20:34,587 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 20:20:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 20:20:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 20:20:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 20:20:34,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2024-10-11 20:20:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,592 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 20:20:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10-11 20:20:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 20:20:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:20:34,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:20:34,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1727384443, now seen corresponding path program 1 times [2024-10-11 20:20:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147830163] [2024-10-11 20:20:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147830163] [2024-10-11 20:20:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147830163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876124043] [2024-10-11 20:20:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,643 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-10-11 20:20:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,663 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-11 20:20:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-11 20:20:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,665 INFO L225 Difference]: With dead ends: 32 [2024-10-11 20:20:34,665 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:20:34,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 20:20:34,666 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:20:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:20:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 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-10-11 20:20:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-11 20:20:34,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2024-10-11 20:20:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,678 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-11 20:20:34,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-10-11 20:20:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-11 20:20:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:20:34,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:20:34,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2009310241, now seen corresponding path program 1 times [2024-10-11 20:20:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703603613] [2024-10-11 20:20:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703603613] [2024-10-11 20:20:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703603613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:20:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230995481] [2024-10-11 20:20:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:20:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:20:34,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:20:34,756 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 20:20:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,793 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-11 20:20:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:20:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-11 20:20:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,796 INFO L225 Difference]: With dead ends: 31 [2024-10-11 20:20:34,796 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 20:20:34,796 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-10-11 20:20:34,797 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 20:20:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 20:20:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-10-11 20:20:34,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2024-10-11 20:20:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-10-11 20:20:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 20:20:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-10-11 20:20:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:20:34,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:20:34,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 402246416, now seen corresponding path program 1 times [2024-10-11 20:20:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350770591] [2024-10-11 20:20:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:20:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350770591] [2024-10-11 20:20:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350770591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23069440] [2024-10-11 20:20:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,840 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10-11 20:20:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,851 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-10-11 20:20:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10-11 20:20:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,852 INFO L225 Difference]: With dead ends: 29 [2024-10-11 20:20:34,852 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:20:34,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 20:20:34,855 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:20:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 20:20:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-11 20:20:34,865 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2024-10-11 20:20:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,865 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-11 20:20:34,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10-11 20:20:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-11 20:20:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:20:34,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:20:34,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -415262923, now seen corresponding path program 1 times [2024-10-11 20:20:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937929285] [2024-10-11 20:20:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:20:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937929285] [2024-10-11 20:20:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937929285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:20:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575399053] [2024-10-11 20:20:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,921 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-10-11 20:20:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:34,935 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-11 20:20:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:34,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-10-11 20:20:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:34,937 INFO L225 Difference]: With dead ends: 43 [2024-10-11 20:20:34,937 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 20:20:34,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 20:20:34,939 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:34,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 20:20:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-11 20:20:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 20:20:34,951 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-11 20:20:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:34,951 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 20:20:34,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-10-11 20:20:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 20:20:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:20:34,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:34,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:34,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:20:34,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:34,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -415261481, now seen corresponding path program 1 times [2024-10-11 20:20:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336773406] [2024-10-11 20:20:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:20:34,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336773406] [2024-10-11 20:20:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336773406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:34,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:20:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453193554] [2024-10-11 20:20:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:34,997 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-10-11 20:20:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:35,018 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-11 20:20:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-10-11 20:20:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:35,019 INFO L225 Difference]: With dead ends: 39 [2024-10-11 20:20:35,020 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:20:35,020 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-10-11 20:20:35,021 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:35,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:20:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2024-10-11 20:20:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 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-10-11 20:20:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-10-11 20:20:35,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2024-10-11 20:20:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:35,026 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-11 20:20:35,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-10-11 20:20:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-10-11 20:20:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:20:35,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:35,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:20:35,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 365677081, now seen corresponding path program 1 times [2024-10-11 20:20:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160082374] [2024-10-11 20:20:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:35,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160082374] [2024-10-11 20:20:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160082374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:35,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259070475] [2024-10-11 20:20:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:35,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:35,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:20:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:35,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:20:35,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259070475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:35,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:20:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981510442] [2024-10-11 20:20:35,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:20:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:20:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:35,289 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 20:20:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:35,324 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-10-11 20:20:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:20:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 20:20:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:35,325 INFO L225 Difference]: With dead ends: 87 [2024-10-11 20:20:35,325 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 20:20:35,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:20:35,326 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:35,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 20:20:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-10-11 20:20:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.146341463414634) internal successors, (94), 83 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-10-11 20:20:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-11 20:20:35,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2024-10-11 20:20:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:35,338 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-11 20:20:35,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-11 20:20:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-11 20:20:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:20:35,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:35,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:20:35,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:20:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:35,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1523743214, now seen corresponding path program 1 times [2024-10-11 20:20:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171639770] [2024-10-11 20:20:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:20:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171639770] [2024-10-11 20:20:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171639770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:20:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:20:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645875577] [2024-10-11 20:20:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:20:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:20:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:20:35,588 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-10-11 20:20:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:35,599 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-11 20:20:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:20:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-10-11 20:20:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:35,600 INFO L225 Difference]: With dead ends: 84 [2024-10-11 20:20:35,600 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 20:20:35,601 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-10-11 20:20:35,601 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:35,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 20:20:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2024-10-11 20:20:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-11 20:20:35,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 23 [2024-10-11 20:20:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:35,609 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-11 20:20:35,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-10-11 20:20:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-11 20:20:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:20:35,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:35,610 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2024-10-11 20:20:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:20:35,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1371586555, now seen corresponding path program 2 times [2024-10-11 20:20:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239670656] [2024-10-11 20:20:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239670656] [2024-10-11 20:20:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239670656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143955156] [2024-10-11 20:20:35,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:20:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:35,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:35,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:20:35,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:20:35,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:35,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:20:35,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143955156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:35,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:20:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357336496] [2024-10-11 20:20:35,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:20:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:35,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:20:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:35,986 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-10-11 20:20:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:36,044 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-10-11 20:20:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:20:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 20:20:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:36,046 INFO L225 Difference]: With dead ends: 119 [2024-10-11 20:20:36,047 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:20:36,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:36,047 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:36,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:20:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:20:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 20:20:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0940170940170941) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 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-10-11 20:20:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-10-11 20:20:36,062 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 35 [2024-10-11 20:20:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:36,062 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-10-11 20:20:36,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-10-11 20:20:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-10-11 20:20:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 20:20:36,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:36,064 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2024-10-11 20:20:36,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:36,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:36,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1582553413, now seen corresponding path program 3 times [2024-10-11 20:20:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311208586] [2024-10-11 20:20:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311208586] [2024-10-11 20:20:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311208586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189408957] [2024-10-11 20:20:36,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:20:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:36,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:20:36,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:20:36,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:36,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:20:36,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:36,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189408957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-11 20:20:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038152183] [2024-10-11 20:20:37,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:20:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:20:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:20:37,044 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 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-10-11 20:20:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:37,169 INFO L93 Difference]: Finished difference Result 251 states and 284 transitions. [2024-10-11 20:20:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:20:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 20:20:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:37,172 INFO L225 Difference]: With dead ends: 251 [2024-10-11 20:20:37,172 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 20:20:37,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:20:37,173 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 158 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:37,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 208 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 20:20:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-11 20:20:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.0923694779116466) internal successors, (272), 249 states have internal predecessors, (272), 0 states have call successors, (0), 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-10-11 20:20:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 272 transitions. [2024-10-11 20:20:37,202 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 272 transitions. Word has length 77 [2024-10-11 20:20:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:37,202 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 272 transitions. [2024-10-11 20:20:37,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 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-10-11 20:20:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 272 transitions. [2024-10-11 20:20:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 20:20:37,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:37,213 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2024-10-11 20:20:37,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:37,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:37,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:37,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1483318331, now seen corresponding path program 4 times [2024-10-11 20:20:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:37,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099701741] [2024-10-11 20:20:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:20:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099701741] [2024-10-11 20:20:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099701741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125257870] [2024-10-11 20:20:38,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:20:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:38,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:38,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:20:38,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:20:38,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:38,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 20:20:38,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 1129 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-10-11 20:20:38,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:20:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125257870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:38,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:20:38,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 36 [2024-10-11 20:20:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971538239] [2024-10-11 20:20:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:38,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:20:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:20:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:20:38,583 INFO L87 Difference]: Start difference. First operand 250 states and 272 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:38,736 INFO L93 Difference]: Finished difference Result 1418 states and 1593 transitions. [2024-10-11 20:20:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:20:38,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-10-11 20:20:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:38,743 INFO L225 Difference]: With dead ends: 1418 [2024-10-11 20:20:38,744 INFO L226 Difference]: Without dead ends: 1270 [2024-10-11 20:20:38,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:20:38,747 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:38,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-11 20:20:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1262. [2024-10-11 20:20:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.1245043616177637) internal successors, (1418), 1261 states have internal predecessors, (1418), 0 states have call successors, (0), 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-10-11 20:20:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1418 transitions. [2024-10-11 20:20:38,796 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1418 transitions. Word has length 161 [2024-10-11 20:20:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:38,797 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1418 transitions. [2024-10-11 20:20:38,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1418 transitions. [2024-10-11 20:20:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 20:20:38,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:38,803 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1] [2024-10-11 20:20:38,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:20:39,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:20:39,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -112008549, now seen corresponding path program 1 times [2024-10-11 20:20:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010629608] [2024-10-11 20:20:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:39,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-11 20:20:39,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010629608] [2024-10-11 20:20:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010629608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124772217] [2024-10-11 20:20:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:39,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:39,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:39,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:39,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:20:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:39,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:20:39,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-11 20:20:39,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-11 20:20:39,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124772217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:39,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:39,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-11 20:20:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758999158] [2024-10-11 20:20:39,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:39,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:20:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:39,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:20:39,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:39,542 INFO L87 Difference]: Start difference. First operand 1262 states and 1418 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:39,612 INFO L93 Difference]: Finished difference Result 1434 states and 1609 transitions. [2024-10-11 20:20:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:20:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-10-11 20:20:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:39,613 INFO L225 Difference]: With dead ends: 1434 [2024-10-11 20:20:39,615 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 20:20:39,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 332 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:20:39,620 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:39,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 20:20:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2024-10-11 20:20:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.039301310043668) internal successors, (238), 229 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 238 transitions. [2024-10-11 20:20:39,644 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 238 transitions. Word has length 169 [2024-10-11 20:20:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:39,645 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 238 transitions. [2024-10-11 20:20:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 238 transitions. [2024-10-11 20:20:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 20:20:39,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:39,648 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1] [2024-10-11 20:20:39,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:20:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:20:39,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:39,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1518226789, now seen corresponding path program 2 times [2024-10-11 20:20:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905795138] [2024-10-11 20:20:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:20:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:40,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905795138] [2024-10-11 20:20:40,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905795138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:40,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390345275] [2024-10-11 20:20:40,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:20:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:40,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:40,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:40,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:20:40,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:20:40,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:40,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:20:40,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:20:40,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:20:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390345275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:41,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2024-10-11 20:20:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424929227] [2024-10-11 20:20:41,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 20:20:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 20:20:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:20:41,712 INFO L87 Difference]: Start difference. First operand 230 states and 238 transitions. Second operand has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 0 states have call successors, (0), 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-10-11 20:20:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:41,871 INFO L93 Difference]: Finished difference Result 411 states and 442 transitions. [2024-10-11 20:20:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 20:20:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 0 states have call successors, (0), 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 169 [2024-10-11 20:20:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:41,874 INFO L225 Difference]: With dead ends: 411 [2024-10-11 20:20:41,874 INFO L226 Difference]: Without dead ends: 410 [2024-10-11 20:20:41,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:20:41,877 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:41,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 304 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-11 20:20:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-10-11 20:20:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.02200488997555) internal successors, (418), 409 states have internal predecessors, (418), 0 states have call successors, (0), 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-10-11 20:20:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 418 transitions. [2024-10-11 20:20:41,889 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 418 transitions. Word has length 169 [2024-10-11 20:20:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 418 transitions. [2024-10-11 20:20:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 0 states have call successors, (0), 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-10-11 20:20:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 418 transitions. [2024-10-11 20:20:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 20:20:41,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:41,895 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 6, 5, 5, 5, 1, 1] [2024-10-11 20:20:41,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:42,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:20:42,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 492636370, now seen corresponding path program 3 times [2024-10-11 20:20:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177641870] [2024-10-11 20:20:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:20:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177641870] [2024-10-11 20:20:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177641870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900354020] [2024-10-11 20:20:44,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:20:44,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:44,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:44,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:44,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:20:44,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2024-10-11 20:20:44,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:44,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 20:20:44,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:20:45,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:20:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:20:47,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900354020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:20:47,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:20:47,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2024-10-11 20:20:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642990967] [2024-10-11 20:20:47,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:20:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-11 20:20:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-11 20:20:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:20:47,778 INFO L87 Difference]: Start difference. First operand 410 states and 418 transitions. Second operand has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 0 states have call successors, (0), 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-10-11 20:20:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:48,181 INFO L93 Difference]: Finished difference Result 767 states and 822 transitions. [2024-10-11 20:20:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 20:20:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 0 states have call successors, (0), 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 349 [2024-10-11 20:20:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:48,187 INFO L225 Difference]: With dead ends: 767 [2024-10-11 20:20:48,187 INFO L226 Difference]: Without dead ends: 766 [2024-10-11 20:20:48,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:20:48,190 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:48,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 624 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:20:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-11 20:20:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2024-10-11 20:20:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.011764705882353) internal successors, (774), 765 states have internal predecessors, (774), 0 states have call successors, (0), 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-10-11 20:20:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 774 transitions. [2024-10-11 20:20:48,214 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 774 transitions. Word has length 349 [2024-10-11 20:20:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 774 transitions. [2024-10-11 20:20:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 0 states have call successors, (0), 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-10-11 20:20:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 774 transitions. [2024-10-11 20:20:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-10-11 20:20:48,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:20:48,228 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 11, 10, 10, 10, 1, 1] [2024-10-11 20:20:48,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:20:48,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:48,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:20:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:20:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 124833051, now seen corresponding path program 4 times [2024-10-11 20:20:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:20:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324990607] [2024-10-11 20:20:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:20:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:20:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:20:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 0 proven. 32197 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 20:20:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:20:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324990607] [2024-10-11 20:20:55,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324990607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:20:55,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041127739] [2024-10-11 20:20:55,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:20:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:20:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:20:55,463 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:20:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:20:55,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:20:55,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:20:55,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:20:55,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:20:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 29535 proven. 0 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2024-10-11 20:20:56,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:20:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041127739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:20:56,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:20:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [95] total 107 [2024-10-11 20:20:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633936827] [2024-10-11 20:20:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:20:56,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:20:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:20:56,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:20:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-10-11 20:20:56,756 INFO L87 Difference]: Start difference. First operand 766 states and 774 transitions. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:20:56,839 INFO L93 Difference]: Finished difference Result 766 states and 774 transitions. [2024-10-11 20:20:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:20:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 705 [2024-10-11 20:20:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:20:56,840 INFO L225 Difference]: With dead ends: 766 [2024-10-11 20:20:56,840 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:20:56,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-10-11 20:20:56,845 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:20:56,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:20:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:20:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:20:56,846 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-10-11 20:20:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:20:56,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2024-10-11 20:20:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:20:56,846 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:20:56,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:20:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:20:56,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:20:56,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 20:20:56,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 20:20:56,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 20:20:56,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 20:20:56,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 20:20:56,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 20:20:56,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 20:20:56,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 20:20:56,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:20:57,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:20:57,059 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:20:57,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:21:00,198 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:21:00,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:21:00 BoogieIcfgContainer [2024-10-11 20:21:00,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:21:00,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:21:00,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:21:00,277 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:21:00,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:20:33" (3/4) ... [2024-10-11 20:21:00,279 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:21:00,286 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:21:00,287 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:21:00,287 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:21:00,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:21:00,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:21:00,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:21:00,394 INFO L158 Benchmark]: Toolchain (without parser) took 26945.83ms. Allocated memory was 165.7MB in the beginning and 780.1MB in the end (delta: 614.5MB). Free memory was 137.0MB in the beginning and 743.3MB in the end (delta: -606.3MB). Peak memory consumption was 472.1MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,395 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:21:00,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.70ms. Allocated memory is still 165.7MB. Free memory was 136.7MB in the beginning and 128.4MB in the end (delta: 8.3MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.50ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,395 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 165.7MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,396 INFO L158 Benchmark]: RCFGBuilder took 223.04ms. Allocated memory is still 165.7MB. Free memory was 125.3MB in the beginning and 114.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,396 INFO L158 Benchmark]: TraceAbstraction took 26321.27ms. Allocated memory was 165.7MB in the beginning and 780.1MB in the end (delta: 614.5MB). Free memory was 113.8MB in the beginning and 283.3MB in the end (delta: -169.6MB). Peak memory consumption was 452.2MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,397 INFO L158 Benchmark]: Witness Printer took 116.88ms. Allocated memory is still 780.1MB. Free memory was 283.3MB in the beginning and 743.3MB in the end (delta: -459.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:21:00,399 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.15ms. Allocated memory is still 130.0MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.70ms. Allocated memory is still 165.7MB. Free memory was 136.7MB in the beginning and 128.4MB in the end (delta: 8.3MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.50ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 165.7MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.04ms. Allocated memory is still 165.7MB. Free memory was 125.3MB in the beginning and 114.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26321.27ms. Allocated memory was 165.7MB in the beginning and 780.1MB in the end (delta: 614.5MB). Free memory was 113.8MB in the beginning and 283.3MB in the end (delta: -169.6MB). Peak memory consumption was 452.2MB. Max. memory is 16.1GB. * Witness Printer took 116.88ms. Allocated memory is still 780.1MB. Free memory was 283.3MB in the beginning and 743.3MB in the end (delta: -459.9MB). 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: 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: 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, 21 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 17, TraceHistogramMax: 95, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 1817 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1548 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 269 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2713 GetRequests, 2370 SyntacticMatches, 7 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1262occurred in iteration=13, InterpolantAutomatonStates: 252, 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, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 3445 NumberOfCodeBlocks, 3445 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 4227 ConstructedInterpolants, 0 QuantifiedInterpolants, 11581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3153 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 39097/103123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= c) && (j == 11)) && (c <= 2147483615)) && (i <= 9)) && (6 <= i)) || (((((c <= 27) && (0 <= c)) && (12 <= j)) && (2 <= i)) && (i <= 9))) || (((c == 0) && (i == 0)) && (3 == j))) || (((((0 <= c) && (7 == j)) && (c <= 40)) && (i <= 9)) && (4 <= i))) || (((((c <= 45) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (4 <= i))) || ((((j == 4) && (i == 0)) && (c <= 1)) && (0 <= c))) || (((((c <= 2147483627) && (0 <= c)) && (i <= 9)) && (8 <= i)) && (5 == j))) || (((((1 <= i) && (c <= 14)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((7 <= i) && (c <= 2147483616)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 33) && (0 <= c)) && (3 <= i)) && (9 == j)) && (i <= 9))) || (((((c <= 24) && (0 <= c)) && (2 <= i)) && (9 == j)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (c <= 31)) && (7 == j)) && (i <= 9))) || (((((c <= 38) && (0 <= c)) && (i <= 9)) && (5 == j)) && (4 <= i))) || (((((c <= 2147483611) && (0 <= c)) && (7 == j)) && (i <= 9)) && (6 <= i))) || (((((0 <= c) && (c <= 2147483614)) && (i <= 9)) && (j == 10)) && (6 <= i))) || (((((6 == j) && (0 <= c)) && (3 <= i)) && (i <= 9)) && (c <= 30))) || (((((0 <= c) && (j == 11)) && (c <= 26)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483607) && (0 <= c)) && (3 == j)) && (i <= 9)) && (6 <= i))) || (((((5 <= i) && (0 <= c)) && (c <= 2147483603)) && (i <= 9)) && (j == 8))) || (((((j == 4) && (1 <= i)) && (c <= 10)) && (0 <= c)) && (i <= 9))) || (((((c <= 43) && (0 <= c)) && (i <= 9)) && (j == 10)) && (4 <= i))) || (((((7 <= i) && (c <= 2147483620)) && (0 <= c)) && (7 == j)) && (i <= 9))) || ((((c <= 2147483637) && (6 == j)) && (9 == i)) && (0 <= c))) || (((((5 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483604))) || (((((c <= 2147483605) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483632) && (0 <= c)) && (i <= 9)) && (j == 10)) && (8 <= i))) || (((((0 <= c) && (c <= 20)) && (2 <= i)) && (i <= 9)) && (5 == j))) || (((((1 <= i) && (c <= 15)) && (0 <= c)) && (9 == j)) && (i <= 9))) || (((((c <= 25) && (0 <= c)) && (2 <= i)) && (i <= 9)) && (j == 10))) || (((((0 <= c) && (c <= 2147483612)) && (i <= 9)) && (6 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (c <= 6)) && (9 == j)) && (i <= 9))) || (((((j == 4) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 2147483617))) || (((((0 <= c) && (7 == j)) && (i <= 9)) && (c <= 2147483629)) && (8 <= i))) || (((((c <= 2147483606) && (5 <= i)) && (0 <= c)) && (j == 11)) && (i <= 9))) || (((((c <= 21) && (6 == j)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483600) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (5 == j))) || (((((c <= 36) && (0 <= c)) && (3 == j)) && (i <= 9)) && (4 <= i))) || (((((c <= 2147483613) && (0 <= c)) && (9 == j)) && (i <= 9)) && (6 <= i))) || (((((c <= 35) && (0 <= c)) && (3 <= i)) && (j == 11)) && (i <= 9))) || (((((0 <= c) && (c <= 8)) && (j == 11)) && (0 <= i)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (7 == j)) && (i <= 9)) && (c <= 13))) || (((((7 <= i) && (c <= 2147483625)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (c <= 2147483610)) && (i <= 9)) && (6 <= i))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483623)) && (i <= 9)) && (j == 10))) || (((((c <= 4) && (0 <= c)) && (0 <= i)) && (7 == j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (c <= 3))) || (((((c <= 2147483628) && (6 == j)) && (0 <= c)) && (i <= 9)) && (8 <= i))) || (((((j == 4) && (0 <= c)) && (i <= 9)) && (6 <= i)) && (c <= 2147483608))) || (((((c <= 2147483634) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (j == 11)) && (c <= 44)) && (i <= 9)) && (4 <= i))) || (((((0 <= c) && (i <= 9)) && (4 <= i)) && (c <= 41)) && (j == 8))) || (((((c <= 27) && (0 <= c)) && (3 <= i)) && (3 == j)) && (i <= 9))) || (((((5 <= i) && (c <= 2147483602)) && (0 <= c)) && (7 == j)) && (i <= 9))) || (((((j == 4) && (0 <= c)) && (c <= 2147483626)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (c <= 23)) && (2 <= i)) && (i <= 9)) && (j == 8))) || ((((9 == i) && (0 <= c)) && (12 <= j)) && (c <= 2147483643))) || (((((c <= 2147483616) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (6 <= i))) || (((((c <= 42) && (0 <= c)) && (9 == j)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (0 <= c)) && (i <= 9)) && (j == 10)) && (c <= 16))) || (((((0 <= c) && (i <= 9)) && (c <= 2147483630)) && (8 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (12 <= j)) && (c <= 9)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483618)) && (i <= 9)) && (5 == j))) || (((((j == 4) && (c <= 28)) && (0 <= c)) && (3 <= i)) && (i <= 9))) || (((((6 == j) && (c <= 39)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((j == 4) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 46))) || (((((1 <= i) && (0 <= c)) && (3 == j)) && (c <= 9)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (c <= 11)) && (i <= 9)) && (5 == j))) || (((((c <= 2147483607) && (5 <= i)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((c <= 2147483633) && (0 <= c)) && (j == 11)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 29)) && (5 == j))) || (((((7 <= i) && (c <= 2147483619)) && (6 == j)) && (0 <= c)) && (i <= 9))) || ((((9 == i) && (0 <= c)) && (j == 11)) && (c <= 2147483642))) || ((((c <= 2147483641) && (9 == i)) && (0 <= c)) && (j == 10))) || (((((j == 4) && (c <= 19)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || ((((9 == i) && (c <= 2147483634)) && (0 <= c)) && (3 == j))) || ((((9 == i) && (c <= 2147483638)) && (0 <= c)) && (7 == j))) || ((((9 == i) && (c <= 2147483639)) && (0 <= c)) && (j == 8))) || (((((c <= 5) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (j == 8))) || (((((1 <= i) && (0 <= c)) && (j == 11)) && (i <= 9)) && (c <= 17))) || ((((9 == i) && (0 <= c)) && (9 == j)) && (c <= 2147483640))) || (((((c <= 22) && (0 <= c)) && (7 == j)) && (2 <= i)) && (i <= 9))) || (((((c <= 36) && (0 <= c)) && (3 <= i)) && (12 <= j)) && (i <= 9))) || (((((0 <= c) && (0 <= i)) && (c <= 7)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483621) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((6 == j) && (5 <= i)) && (0 <= c)) && (c <= 2147483601)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483624)) && (j == 11)) && (i <= 9))) || ((((c <= 2147483636) && (9 == i)) && (0 <= c)) && (5 == j))) || (((((0 <= c) && (0 <= i)) && (c <= 2)) && (i <= 9)) && (5 == j))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (j == 10)) && (c <= 34))) || (((((0 <= c) && (3 == j)) && (2 <= i)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 32)) && (j == 8))) || (((((5 <= i) && (c <= 45)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 2147483625) && (0 <= c)) && (3 == j)) && (i <= 9)) && (8 <= i))) || (((((c <= 2147483631) && (0 <= c)) && (9 == j)) && (i <= 9)) && (8 <= i))) || (((((7 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483622))) || ((((j == 4) && (9 == i)) && (0 <= c)) && (c <= 2147483635))) || (((((1 <= i) && (0 <= c)) && (12 <= j)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (i <= 9)) && (5 == j)) && (6 <= i)) && (c <= 2147483609))) || (((((j == 4) && (c <= 37)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (6 == j)) && (0 <= c)) && (c <= 12)) && (i <= 9))) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((((((((((((c <= 2147483625) && (0 <= c)) && (8 <= i)) || (((0 <= c) && (2 <= i)) && (c <= 18))) || (((c <= 27) && (0 <= c)) && (3 <= i))) || (((5 <= i) && (c <= 45)) && (0 <= c))) || (((1 <= i) && (0 <= c)) && (c <= 9))) || (((7 <= i) && (c <= 2147483616)) && (0 <= c))) || (((c <= 2147483607) && (0 <= c)) && (6 <= i))) || (((c <= 2147483634) && (0 <= c)) && (9 <= i))) || (((c <= 36) && (0 <= c)) && (4 <= i))) || ((c == 0) && (i == 0))) || (((10 <= i) && (0 <= c)) && (c <= 2147483643))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:21:00,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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