./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/b.14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/b.14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e0029e4ef6d93314dd28a1b067e9a0f7a5ca34b8281e95ccf7b3ad64c7537db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:35:42,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:35:42,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:35:42,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:35:42,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:35:42,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:35:42,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:35:42,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:35:42,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:35:42,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:35:42,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:35:42,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:35:42,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:35:42,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:35:42,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:35:42,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:35:42,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:35:42,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:35:42,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:35:42,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:35:42,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:35:42,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:35:42,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:35:42,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0029e4ef6d93314dd28a1b067e9a0f7a5ca34b8281e95ccf7b3ad64c7537db6 [2025-03-04 10:35:42,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:35:42,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:35:42,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:35:42,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:35:42,348 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:35:42,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/b.14.c [2025-03-04 10:35:43,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1d9b017/e35f392205e34e6ba33732b758d2b4e4/FLAG269050cc9 [2025-03-04 10:35:43,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:35:43,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.14.c [2025-03-04 10:35:43,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1d9b017/e35f392205e34e6ba33732b758d2b4e4/FLAG269050cc9 [2025-03-04 10:35:43,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1d9b017/e35f392205e34e6ba33732b758d2b4e4 [2025-03-04 10:35:43,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:35:43,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:35:43,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:35:43,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:35:43,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:35:43,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bc88bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43, skipping insertion in model container [2025-03-04 10:35:43,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:35:43,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:35:43,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:35:43,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:35:43,858 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:35:43,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43 WrapperNode [2025-03-04 10:35:43,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:35:43,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:35:43,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:35:43,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:35:43,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,876 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2025-03-04 10:35:43,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:35:43,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:35:43,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:35:43,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:35:43,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,888 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:35:43,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:35:43,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:35:43,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:35:43,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:35:43,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (1/1) ... [2025-03-04 10:35:43,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:35:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:43,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:35:43,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:35:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:35:43,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:35:43,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:35:43,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:35:44,052 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 10:35:44,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:35:44,058 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:35:44,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:35:44,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:35:44 BoogieIcfgContainer [2025-03-04 10:35:44,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:35:44,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:35:44,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:35:44,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:35:44,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:35:43" (1/3) ... [2025-03-04 10:35:44,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919eb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:35:44, skipping insertion in model container [2025-03-04 10:35:44,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:35:43" (2/3) ... [2025-03-04 10:35:44,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919eb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:35:44, skipping insertion in model container [2025-03-04 10:35:44,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:35:44" (3/3) ... [2025-03-04 10:35:44,068 INFO L128 eAbstractionObserver]: Analyzing ICFG b.14.c [2025-03-04 10:35:44,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:35:44,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.14.c that has 1 procedures, 19 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 10:35:44,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:35:44,124 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;@4628bbda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:35:44,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:35:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:35:44,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:35:44,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 46729104, now seen corresponding path program 1 times [2025-03-04 10:35:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856500324] [2025-03-04 10:35:44,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:35:44,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:35:44,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856500324] [2025-03-04 10:35:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856500324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993509936] [2025-03-04 10:35:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,262 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,297 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-04 10:35:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:35:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,304 INFO L225 Difference]: With dead ends: 24 [2025-03-04 10:35:44,305 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 10:35:44,307 INFO L434 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 [2025-03-04 10:35:44,309 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:44,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 10:35:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-04 10:35:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-04 10:35:44,329 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 5 [2025-03-04 10:35:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,330 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-04 10:35:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-04 10:35:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:35:44,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:35:44,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1448602205, now seen corresponding path program 1 times [2025-03-04 10:35:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920860235] [2025-03-04 10:35:44,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:35:44,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:35:44,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920860235] [2025-03-04 10:35:44,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920860235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442444652] [2025-03-04 10:35:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,371 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2025-03-04 10:35:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,387 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-04 10:35:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 [2025-03-04 10:35:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,387 INFO L225 Difference]: With dead ends: 18 [2025-03-04 10:35:44,388 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 10:35:44,388 INFO L434 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 [2025-03-04 10:35:44,388 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 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 [2025-03-04 10:35:44,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 10:35:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 10:35:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-04 10:35:44,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 6 [2025-03-04 10:35:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,393 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-04 10:35:44,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2025-03-04 10:35:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-04 10:35:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:35:44,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:35:44,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995374, now seen corresponding path program 1 times [2025-03-04 10:35:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216020889] [2025-03-04 10:35:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:35:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:35:44,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216020889] [2025-03-04 10:35:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216020889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548884258] [2025-03-04 10:35:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,443 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2025-03-04 10:35:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,461 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 10:35:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 [2025-03-04 10:35:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,465 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:35:44,465 INFO L226 Difference]: Without dead ends: 16 [2025-03-04 10:35:44,465 INFO L434 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 [2025-03-04 10:35:44,465 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:44,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-04 10:35:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 10:35:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-03-04 10:35:44,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 7 [2025-03-04 10:35:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,472 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-04 10:35:44,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2025-03-04 10:35:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-03-04 10:35:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:35:44,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:35:44,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 537314427, now seen corresponding path program 1 times [2025-03-04 10:35:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586905629] [2025-03-04 10:35:44,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:35:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:35:44,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586905629] [2025-03-04 10:35:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586905629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915452767] [2025-03-04 10:35:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,517 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2025-03-04 10:35:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,528 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-04 10:35:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2025-03-04 10:35:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,529 INFO L225 Difference]: With dead ends: 16 [2025-03-04 10:35:44,529 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 10:35:44,529 INFO L434 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 [2025-03-04 10:35:44,530 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 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 [2025-03-04 10:35:44,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 10:35:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 10:35:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-04 10:35:44,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 8 [2025-03-04 10:35:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,533 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-04 10:35:44,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2025-03-04 10:35:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-04 10:35:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:35:44,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:35:44,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,534 INFO L85 PathProgramCache]: Analyzing trace with hash -523121972, now seen corresponding path program 1 times [2025-03-04 10:35:44,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599305873] [2025-03-04 10:35:44,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:35:44,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:35:44,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599305873] [2025-03-04 10:35:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599305873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892564223] [2025-03-04 10:35:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,570 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,579 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-03-04 10:35:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:35:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,580 INFO L225 Difference]: With dead ends: 15 [2025-03-04 10:35:44,580 INFO L226 Difference]: Without dead ends: 14 [2025-03-04 10:35:44,581 INFO L434 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 [2025-03-04 10:35:44,581 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:44,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-04 10:35:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 10:35:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-04 10:35:44,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2025-03-04 10:35:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,586 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 10:35:44,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-04 10:35:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:35:44,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:35:44,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash 963088025, now seen corresponding path program 1 times [2025-03-04 10:35:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138577053] [2025-03-04 10:35:44,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:35:44,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:35:44,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138577053] [2025-03-04 10:35:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138577053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:35:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:35:44,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:35:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140855523] [2025-03-04 10:35:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:35:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:35:44,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:35:44,628 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,638 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-04 10:35:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:35:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-04 10:35:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,639 INFO L225 Difference]: With dead ends: 23 [2025-03-04 10:35:44,639 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 10:35:44,639 INFO L434 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 [2025-03-04 10:35:44,640 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:44,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 10:35:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 10:35:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 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) [2025-03-04 10:35:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-04 10:35:44,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2025-03-04 10:35:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,643 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-04 10:35:44,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-04 10:35:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:35:44,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,644 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:35:44,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:44,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2109622903, now seen corresponding path program 1 times [2025-03-04 10:35:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:44,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491301454] [2025-03-04 10:35:44,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:44,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:35:44,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:35:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491301454] [2025-03-04 10:35:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491301454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:44,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278783054] [2025-03-04 10:35:44,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:44,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:44,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:44,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:44,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:35:44,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:35:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:35:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:44,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:35:44,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278783054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:44,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:35:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127208894] [2025-03-04 10:35:44,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:35:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:44,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:35:44,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:35:44,822 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:44,852 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-03-04 10:35:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:35:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 [2025-03-04 10:35:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:44,853 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:35:44,854 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:35:44,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:35:44,854 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:44,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:35:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-04 10:35:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-04 10:35:44,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 12 [2025-03-04 10:35:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:44,861 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-04 10:35:44,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-04 10:35:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:35:44,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:44,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:35:44,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:35:45,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:45,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2040202258, now seen corresponding path program 1 times [2025-03-04 10:35:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002656456] [2025-03-04 10:35:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:35:45,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:35:45,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:45,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002656456] [2025-03-04 10:35:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002656456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150130279] [2025-03-04 10:35:45,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:35:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:45,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:35:45,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:35:45,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:35:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:35:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:45,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:35:45,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:45,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150130279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:45,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:45,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:35:45,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075748199] [2025-03-04 10:35:45,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:45,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:35:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:45,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:35:45,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:35:45,189 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:45,221 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2025-03-04 10:35:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:35:45,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 10:35:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:45,222 INFO L225 Difference]: With dead ends: 110 [2025-03-04 10:35:45,222 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 10:35:45,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:35:45,222 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:45,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 10:35:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 10:35:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-03-04 10:35:45,231 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 17 [2025-03-04 10:35:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:45,231 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-03-04 10:35:45,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-03-04 10:35:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:35:45,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:45,231 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:35:45,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:35:45,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:35:45,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 208948176, now seen corresponding path program 2 times [2025-03-04 10:35:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924255104] [2025-03-04 10:35:45,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:45,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:35:45,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:35:45,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:35:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924255104] [2025-03-04 10:35:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924255104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766899705] [2025-03-04 10:35:45,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:45,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:45,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:35:45,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:35:45,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:35:45,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:45,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:45,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:35:45,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:35:45,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766899705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:45,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 10] total 14 [2025-03-04 10:35:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244102127] [2025-03-04 10:35:45,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:35:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:45,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:35:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:35:45,892 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:45,928 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2025-03-04 10:35:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:35:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 33 [2025-03-04 10:35:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:45,932 INFO L225 Difference]: With dead ends: 109 [2025-03-04 10:35:45,933 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 10:35:45,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:35:45,933 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:45,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 16 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:35:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 10:35:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 47. [2025-03-04 10:35:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-04 10:35:45,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2025-03-04 10:35:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-04 10:35:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-03-04 10:35:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:35:45,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:45,945 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:35:45,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:35:46,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:46,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:46,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:46,146 INFO L85 PathProgramCache]: Analyzing trace with hash -111349159, now seen corresponding path program 2 times [2025-03-04 10:35:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:46,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720209533] [2025-03-04 10:35:46,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:46,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:46,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:35:46,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:35:46,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:46,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:46,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720209533] [2025-03-04 10:35:46,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720209533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:46,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486414383] [2025-03-04 10:35:46,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:46,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:46,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:46,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:46,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:35:46,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:35:46,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:35:46,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:46,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:35:46,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:46,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486414383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:46,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:35:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790166629] [2025-03-04 10:35:46,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:35:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:46,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:35:46,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:35:46,373 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:46,439 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-03-04 10:35:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:35:46,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 10:35:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:46,441 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:35:46,441 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:35:46,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:35:46,441 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:46,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:35:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:35:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 10:35:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-04 10:35:46,451 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 38 [2025-03-04 10:35:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-04 10:35:46,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-04 10:35:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:35:46,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:46,452 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-03-04 10:35:46,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:35:46,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:46,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:46,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -680481799, now seen corresponding path program 3 times [2025-03-04 10:35:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:46,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789276469] [2025-03-04 10:35:46,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:35:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:46,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 11 equivalence classes. [2025-03-04 10:35:46,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:35:46,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:35:46,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789276469] [2025-03-04 10:35:46,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789276469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037756080] [2025-03-04 10:35:46,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:35:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:46,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:46,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:35:46,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 11 equivalence classes. [2025-03-04 10:35:46,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:35:46,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:35:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:46,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:35:46,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:46,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037756080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:47,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:35:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604401478] [2025-03-04 10:35:47,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:35:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:47,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:35:47,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:35:47,210 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 24 states, 23 states have (on average 6.913043478260869) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:47,300 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2025-03-04 10:35:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:35:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.913043478260869) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 10:35:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:47,302 INFO L225 Difference]: With dead ends: 210 [2025-03-04 10:35:47,302 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 10:35:47,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:35:47,302 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 93 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:47,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 168 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:35:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 10:35:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-04 10:35:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1105769230769231) internal successors, (231), 208 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2025-03-04 10:35:47,326 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 80 [2025-03-04 10:35:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:47,327 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2025-03-04 10:35:47,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.913043478260869) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2025-03-04 10:35:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 10:35:47,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:47,331 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1] [2025-03-04 10:35:47,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:35:47,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:35:47,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:47,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash -852752583, now seen corresponding path program 4 times [2025-03-04 10:35:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-03-04 10:35:47,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:35:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:47,549 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-04 10:35:47,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:35:47,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:35:47,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121919366] [2025-03-04 10:35:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121919366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906525543] [2025-03-04 10:35:48,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:35:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:48,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:48,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:48,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:35:48,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-04 10:35:48,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:35:48,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:35:48,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:48,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:35:48,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:48,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906525543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:49,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:35:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551907479] [2025-03-04 10:35:49,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:35:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:49,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:35:49,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:35:49,007 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 48 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:49,195 INFO L93 Difference]: Finished difference Result 426 states and 495 transitions. [2025-03-04 10:35:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:35:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 48 states have internal predecessors, (327), 0 states have call successors, (0), 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 164 [2025-03-04 10:35:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:49,198 INFO L225 Difference]: With dead ends: 426 [2025-03-04 10:35:49,199 INFO L226 Difference]: Without dead ends: 425 [2025-03-04 10:35:49,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:35:49,200 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 241 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:49,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 337 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:35:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-04 10:35:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-04 10:35:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.1108490566037736) internal successors, (471), 424 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 471 transitions. [2025-03-04 10:35:49,232 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 471 transitions. Word has length 164 [2025-03-04 10:35:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 471 transitions. [2025-03-04 10:35:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.957446808510638) internal successors, (327), 48 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 471 transitions. [2025-03-04 10:35:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-04 10:35:49,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:49,238 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1, 1] [2025-03-04 10:35:49,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:35:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:49,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -561357383, now seen corresponding path program 5 times [2025-03-04 10:35:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-03-04 10:35:49,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:35:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:49,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 332 statements into 47 equivalence classes. [2025-03-04 10:35:49,545 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 332 of 332 statements. [2025-03-04 10:35:49,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:35:49,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:51,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-03-04 10:35:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474414176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527071638] [2025-03-04 10:35:51,144 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:35:51,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:51,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:51,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:35:51,175 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 332 statements into 47 equivalence classes. [2025-03-04 10:35:51,254 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 332 of 332 statements. [2025-03-04 10:35:51,254 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:35:51,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:51,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:35:51,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:51,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527071638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:53,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:53,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 10:35:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334868403] [2025-03-04 10:35:53,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:53,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 10:35:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:53,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 10:35:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:35:53,681 INFO L87 Difference]: Start difference. First operand 425 states and 471 transitions. Second operand has 96 states, 95 states have (on average 6.978947368421053) internal successors, (663), 96 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:54,346 INFO L93 Difference]: Finished difference Result 858 states and 999 transitions. [2025-03-04 10:35:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 10:35:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.978947368421053) internal successors, (663), 96 states have internal predecessors, (663), 0 states have call successors, (0), 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 332 [2025-03-04 10:35:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:54,349 INFO L225 Difference]: With dead ends: 858 [2025-03-04 10:35:54,349 INFO L226 Difference]: Without dead ends: 857 [2025-03-04 10:35:54,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:35:54,351 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 665 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:54,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 675 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:35:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-04 10:35:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2025-03-04 10:35:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.110981308411215) internal successors, (951), 856 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 951 transitions. [2025-03-04 10:35:54,394 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 951 transitions. Word has length 332 [2025-03-04 10:35:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:54,394 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 951 transitions. [2025-03-04 10:35:54,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.978947368421053) internal successors, (663), 96 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 951 transitions. [2025-03-04 10:35:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-03-04 10:35:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:54,402 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 94, 1, 1, 1, 1] [2025-03-04 10:35:54,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:35:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:54,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:54,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1851422023, now seen corresponding path program 6 times [2025-03-04 10:35:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843095521] [2025-03-04 10:35:54,604 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:35:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:54,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 668 statements into 95 equivalence classes. [2025-03-04 10:35:54,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 668 of 668 statements. [2025-03-04 10:35:54,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:35:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843095521] [2025-03-04 10:36:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843095521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013087703] [2025-03-04 10:36:00,032 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:36:00,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:00,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:00,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:36:00,076 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 668 statements into 95 equivalence classes. [2025-03-04 10:36:00,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 668 of 668 statements. [2025-03-04 10:36:00,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:36:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:00,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 10:36:00,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:00,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:36:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013087703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:36:07,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:36:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 10:36:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103905643] [2025-03-04 10:36:07,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:36:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 10:36:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:36:07,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 10:36:07,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:36:07,823 INFO L87 Difference]: Start difference. First operand 857 states and 951 transitions. Second operand has 192 states, 191 states have (on average 6.989528795811518) internal successors, (1335), 192 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:36:15,192 INFO L93 Difference]: Finished difference Result 1722 states and 2007 transitions. [2025-03-04 10:36:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 10:36:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.989528795811518) internal successors, (1335), 192 states have internal predecessors, (1335), 0 states have call successors, (0), 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 668 [2025-03-04 10:36:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:36:15,198 INFO L225 Difference]: With dead ends: 1722 [2025-03-04 10:36:15,198 INFO L226 Difference]: Without dead ends: 1721 [2025-03-04 10:36:15,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1430 GetRequests, 1240 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:36:15,200 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1630 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:36:15,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 1347 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:36:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-03-04 10:36:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2025-03-04 10:36:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.111046511627907) internal successors, (1911), 1720 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 1911 transitions. [2025-03-04 10:36:15,250 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 1911 transitions. Word has length 668 [2025-03-04 10:36:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:36:15,251 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 1911 transitions. [2025-03-04 10:36:15,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.989528795811518) internal successors, (1335), 192 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:36:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 1911 transitions. [2025-03-04 10:36:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2025-03-04 10:36:15,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:36:15,283 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 190, 1, 1, 1, 1] [2025-03-04 10:36:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:36:15,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:36:15,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:36:15,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:36:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1084889927, now seen corresponding path program 7 times [2025-03-04 10:36:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:36:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-03-04 10:36:15,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:36:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:36:15,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-04 10:36:15,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-04 10:36:15,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:15,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:36:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-03-04 10:36:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576321089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:36:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311802368] [2025-03-04 10:36:37,852 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:36:37,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:36:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:36:37,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:36:37,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:36:37,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-04 10:36:38,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-04 10:36:38,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:36:38,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:36:38,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2493 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-04 10:36:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:36:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:36:39,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:37:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:37:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311802368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:37:06,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:37:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-04 10:37:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802137587] [2025-03-04 10:37:06,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:37:06,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-04 10:37:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:37:06,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-04 10:37:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 10:37:06,528 INFO L87 Difference]: Start difference. First operand 1721 states and 1911 transitions. Second operand has 384 states, 383 states have (on average 6.994778067885117) internal successors, (2679), 384 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)