./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/nla-digbench-scaling/prodbin-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:29:44,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:29:44,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:29:44,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:29:44,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:29:44,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:29:44,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:29:44,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:29:44,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:29:44,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:29:44,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:29:44,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:29:44,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:29:44,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:29:44,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:29:44,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:29:44,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:29:44,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:29:44,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:29:44,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:29:44,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:29:44,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:29:44,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:29:44,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:29:44,575 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 [2025-03-09 02:29:44,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:29:44,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:29:44,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:29:44,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:29:44,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:29:44,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-03-09 02:29:46,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd4c9504/0734994f75994714a0e045bb38929104/FLAGa8e3a6294 [2025-03-09 02:29:46,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:29:46,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-03-09 02:29:46,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd4c9504/0734994f75994714a0e045bb38929104/FLAGa8e3a6294 [2025-03-09 02:29:46,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd4c9504/0734994f75994714a0e045bb38929104 [2025-03-09 02:29:46,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:29:46,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:29:46,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:29:46,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:29:46,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:29:46,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c312171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46, skipping insertion in model container [2025-03-09 02:29:46,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:29:46,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:29:46,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:29:46,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:29:46,395 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:29:46,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46 WrapperNode [2025-03-09 02:29:46,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:29:46,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:29:46,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:29:46,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:29:46,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,419 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-09 02:29:46,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:29:46,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:29:46,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:29:46,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:29:46,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,434 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:29:46,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:29:46,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:29:46,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:29:46,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:29:46,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (1/1) ... [2025-03-09 02:29:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:29:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:46,468 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-09 02:29:46,471 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-09 02:29:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:29:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:29:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:29:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:29:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:29:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:29:46,527 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:29:46,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:29:46,709 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-09 02:29:46,709 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:29:46,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:29:46,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:29:46,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:29:46 BoogieIcfgContainer [2025-03-09 02:29:46,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:29:46,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:29:46,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:29:46,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:29:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:29:46" (1/3) ... [2025-03-09 02:29:46,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@956deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:29:46, skipping insertion in model container [2025-03-09 02:29:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:29:46" (2/3) ... [2025-03-09 02:29:46,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@956deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:29:46, skipping insertion in model container [2025-03-09 02:29:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:29:46" (3/3) ... [2025-03-09 02:29:46,725 INFO L128 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound2.c [2025-03-09 02:29:46,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:29:46,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prodbin-ll_unwindbound2.c that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-09 02:29:46,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:29:46,783 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;@1060b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:29:46,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 02:29:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:29:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:29:46,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:46,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:29:46,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:46,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1840557386, now seen corresponding path program 1 times [2025-03-09 02:29:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333089278] [2025-03-09 02:29:46,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:46,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:29:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:29:46,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:46,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:46,876 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-09 02:29:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333089278] [2025-03-09 02:29:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333089278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:29:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484916492] [2025-03-09 02:29:46,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:29:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:46,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:29:46,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:29:46,902 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:46,914 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2025-03-09 02:29:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:29:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:29:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:46,923 INFO L225 Difference]: With dead ends: 108 [2025-03-09 02:29:46,923 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 02:29:46,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:29:46,935 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:46,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 02:29:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 02:29:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 46 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-03-09 02:29:46,984 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 6 [2025-03-09 02:29:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-03-09 02:29:46,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-03-09 02:29:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:29:46,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:46,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:29:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:29:46,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1840527587, now seen corresponding path program 1 times [2025-03-09 02:29:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812821069] [2025-03-09 02:29:46,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:46,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:29:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:29:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:47,110 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-09 02:29:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812821069] [2025-03-09 02:29:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812821069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:29:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116792157] [2025-03-09 02:29:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:47,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:47,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:47,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:47,115 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.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-09 02:29:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:47,173 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-03-09 02:29:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:29:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-09 02:29:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:47,174 INFO L225 Difference]: With dead ends: 59 [2025-03-09 02:29:47,174 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 02:29:47,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:47,175 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:47,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 134 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 02:29:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 02:29:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.606060606060606) internal successors, (53), 50 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-03-09 02:29:47,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 6 [2025-03-09 02:29:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:47,182 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-03-09 02:29:47,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-09 02:29:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-03-09 02:29:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:29:47,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:47,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:47,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:29:47,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1604830738, now seen corresponding path program 1 times [2025-03-09 02:29:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610203903] [2025-03-09 02:29:47,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:47,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:29:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:29:47,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:47,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958869756] [2025-03-09 02:29:47,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:47,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:47,211 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-09 02:29:47,213 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-09 02:29:47,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:29:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:29:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:47,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:29:47,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:47,406 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-09 02:29:47,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610203903] [2025-03-09 02:29:47,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958869756] [2025-03-09 02:29:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958869756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:29:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768524531] [2025-03-09 02:29:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:47,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:29:47,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:47,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:29:47,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:47,408 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 02:29:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:47,550 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-09 02:29:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:29:47,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 02:29:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:47,553 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:29:47,553 INFO L226 Difference]: Without dead ends: 67 [2025-03-09 02:29:47,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:29:47,554 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:47,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 62 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:29:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-09 02:29:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-09 02:29:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 61 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:29:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-09 02:29:47,560 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 9 [2025-03-09 02:29:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:47,561 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-09 02:29:47,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 02:29:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-09 02:29:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:29:47,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:47,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:47,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:29:47,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:47,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:47,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1789854681, now seen corresponding path program 1 times [2025-03-09 02:29:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208492282] [2025-03-09 02:29:47,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:47,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:29:47,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:29:47,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:47,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092851042] [2025-03-09 02:29:47,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:47,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:47,783 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-09 02:29:47,785 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-09 02:29:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:29:47,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:29:47,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:47,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:47,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:29:47,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:47,894 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-09 02:29:47,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208492282] [2025-03-09 02:29:47,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092851042] [2025-03-09 02:29:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092851042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:29:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449313059] [2025-03-09 02:29:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:29:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:47,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:29:47,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:47,896 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-09 02:29:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:47,988 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-03-09 02:29:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:29:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-09 02:29:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:47,989 INFO L225 Difference]: With dead ends: 68 [2025-03-09 02:29:47,989 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 02:29:47,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:29:47,990 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 66 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:29:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 02:29:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-09 02:29:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:29:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-03-09 02:29:47,997 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 10 [2025-03-09 02:29:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:47,997 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-03-09 02:29:47,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-09 02:29:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-03-09 02:29:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 02:29:47,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:47,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:29:48,202 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,SelfDestructingSolverStorable3 [2025-03-09 02:29:48,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash -349079732, now seen corresponding path program 1 times [2025-03-09 02:29:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854424012] [2025-03-09 02:29:48,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:29:48,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:29:48,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:48,266 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-09 02:29:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854424012] [2025-03-09 02:29:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854424012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097262313] [2025-03-09 02:29:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:48,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:48,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:48,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,268 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:48,317 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2025-03-09 02:29:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 02:29:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:48,320 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:29:48,321 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 02:29:48,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,321 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:48,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 70 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 02:29:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2025-03-09 02:29:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 74 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-03-09 02:29:48,327 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 11 [2025-03-09 02:29:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:48,327 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-03-09 02:29:48,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-03-09 02:29:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:29:48,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:48,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:29:48,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2063430199, now seen corresponding path program 1 times [2025-03-09 02:29:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325428697] [2025-03-09 02:29:48,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:29:48,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:29:48,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:48,411 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-09 02:29:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325428697] [2025-03-09 02:29:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325428697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787366864] [2025-03-09 02:29:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,412 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:48,500 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-03-09 02:29:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 02:29:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:48,501 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:29:48,501 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 02:29:48,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,502 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:48,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 73 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:29:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 02:29:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2025-03-09 02:29:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 74 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2025-03-09 02:29:48,514 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 12 [2025-03-09 02:29:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:48,514 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2025-03-09 02:29:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:29:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2025-03-09 02:29:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:29:48,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:48,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:29:48,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1796715980, now seen corresponding path program 1 times [2025-03-09 02:29:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520414659] [2025-03-09 02:29:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:29:48,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:29:48,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:48,613 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-09 02:29:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520414659] [2025-03-09 02:29:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520414659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618544220] [2025-03-09 02:29:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:48,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,615 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:48,659 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2025-03-09 02:29:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 02:29:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:48,660 INFO L225 Difference]: With dead ends: 80 [2025-03-09 02:29:48,660 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 02:29:48,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:48,660 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:48,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 61 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 02:29:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 02:29:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 74 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-09 02:29:48,673 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 22 [2025-03-09 02:29:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:48,674 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-09 02:29:48,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-09 02:29:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:29:48,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:48,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:29:48,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash -136379478, now seen corresponding path program 1 times [2025-03-09 02:29:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335347707] [2025-03-09 02:29:48,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:29:48,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:29:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:48,762 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-09 02:29:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335347707] [2025-03-09 02:29:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335347707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067030148] [2025-03-09 02:29:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:48,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:48,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,764 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:48,817 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-09 02:29:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:48,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-09 02:29:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:48,819 INFO L225 Difference]: With dead ends: 80 [2025-03-09 02:29:48,819 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 02:29:48,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:48,820 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:48,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 02:29:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 02:29:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2025-03-09 02:29:48,829 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 23 [2025-03-09 02:29:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:48,830 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2025-03-09 02:29:48,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2025-03-09 02:29:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:29:48,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:48,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:29:48,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash 67225313, now seen corresponding path program 1 times [2025-03-09 02:29:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169924773] [2025-03-09 02:29:48,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:29:48,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:29:48,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:48,889 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-09 02:29:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169924773] [2025-03-09 02:29:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169924773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767225480] [2025-03-09 02:29:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:48,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:48,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:48,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:48,891 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:48,949 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-03-09 02:29:48,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-09 02:29:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:48,950 INFO L225 Difference]: With dead ends: 84 [2025-03-09 02:29:48,950 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 02:29:48,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:48,951 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:48,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 02:29:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-03-09 02:29:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 73 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2025-03-09 02:29:48,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 24 [2025-03-09 02:29:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:48,956 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2025-03-09 02:29:48,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2025-03-09 02:29:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:29:48,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:48,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:48,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:29:48,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2083984681, now seen corresponding path program 1 times [2025-03-09 02:29:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016024625] [2025-03-09 02:29:48,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:48,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:29:48,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:29:48,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:48,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,019 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-09 02:29:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016024625] [2025-03-09 02:29:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016024625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397175821] [2025-03-09 02:29:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:49,021 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,054 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2025-03-09 02:29:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-09 02:29:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,056 INFO L225 Difference]: With dead ends: 78 [2025-03-09 02:29:49,056 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:29:49,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:49,057 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 33 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:29:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-09 02:29:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 69 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-09 02:29:49,066 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 25 [2025-03-09 02:29:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,066 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-09 02:29:49,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-09 02:29:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:29:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:29:49,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 158020936, now seen corresponding path program 1 times [2025-03-09 02:29:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699834618] [2025-03-09 02:29:49,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:49,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:29:49,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:29:49,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,105 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-09 02:29:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699834618] [2025-03-09 02:29:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699834618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817848114] [2025-03-09 02:29:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:49,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:49,106 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,156 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-03-09 02:29:49,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-09 02:29:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,157 INFO L225 Difference]: With dead ends: 79 [2025-03-09 02:29:49,157 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:29:49,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:49,158 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 55 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:29:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-09 02:29:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-03-09 02:29:49,165 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 26 [2025-03-09 02:29:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,165 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-03-09 02:29:49,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-03-09 02:29:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:29:49,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:29:49,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:49,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash 603681702, now seen corresponding path program 1 times [2025-03-09 02:29:49,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:49,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596761508] [2025-03-09 02:29:49,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:29:49,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:29:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,204 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-09 02:29:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596761508] [2025-03-09 02:29:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596761508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:49,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:29:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485119419] [2025-03-09 02:29:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:29:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:29:49,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:29:49,205 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,250 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-03-09 02:29:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 02:29:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,251 INFO L225 Difference]: With dead ends: 79 [2025-03-09 02:29:49,251 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:29:49,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:49,251 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 56 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:29:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-09 02:29:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-03-09 02:29:49,254 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2025-03-09 02:29:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-03-09 02:29:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-03-09 02:29:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:29:49,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,255 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:29:49,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1254519047, now seen corresponding path program 1 times [2025-03-09 02:29:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072037478] [2025-03-09 02:29:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:49,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:29:49,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:29:49,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,328 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-09 02:29:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072037478] [2025-03-09 02:29:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072037478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:29:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613513280] [2025-03-09 02:29:49,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:49,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:49,331 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-09 02:29:49,332 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-09 02:29:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:29:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:29:49,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:29:49,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:49,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613513280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:29:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:29:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721908039] [2025-03-09 02:29:49,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:29:49,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:29:49,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:29:49,420 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,436 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-03-09 02:29:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:29:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 02:29:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,437 INFO L225 Difference]: With dead ends: 78 [2025-03-09 02:29:49,437 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 02:29:49,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:29:49,438 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 103 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 02:29:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 02:29:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2025-03-09 02:29:49,441 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 27 [2025-03-09 02:29:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2025-03-09 02:29:49,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2025-03-09 02:29:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:29:49,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:29:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:49,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1534263558, now seen corresponding path program 1 times [2025-03-09 02:29:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375497955] [2025-03-09 02:29:49,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:49,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:29:49,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:29:49,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,694 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-09 02:29:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375497955] [2025-03-09 02:29:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375497955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:29:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928558639] [2025-03-09 02:29:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:29:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:29:49,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:29:49,695 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,732 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2025-03-09 02:29:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:29:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 02:29:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,733 INFO L225 Difference]: With dead ends: 83 [2025-03-09 02:29:49,733 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 02:29:49,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:29:49,734 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 02:29:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-03-09 02:29:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-03-09 02:29:49,737 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 28 [2025-03-09 02:29:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,737 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-03-09 02:29:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-03-09 02:29:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:29:49,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:29:49,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:49,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 235384806, now seen corresponding path program 1 times [2025-03-09 02:29:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749256748] [2025-03-09 02:29:49,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:49,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:29:49,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:29:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749256748] [2025-03-09 02:29:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749256748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:29:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053271688] [2025-03-09 02:29:49,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:49,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:49,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:49,802 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-09 02:29:49,804 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-09 02:29:49,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:29:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:29:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:49,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:29:49,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:49,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053271688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:29:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:29:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207773392] [2025-03-09 02:29:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:49,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:29:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:49,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:29:49,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:29:49,873 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:49,902 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-03-09 02:29:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:29:49,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 02:29:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:49,904 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:29:49,904 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 02:29:49,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:29:49,905 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:49,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:29:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 02:29:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 02:29:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-09 02:29:49,908 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 28 [2025-03-09 02:29:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:49,908 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-09 02:29:49,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-09 02:29:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:29:49,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:49,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:49,915 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-09 02:29:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:29:50,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1428467772, now seen corresponding path program 1 times [2025-03-09 02:29:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414011544] [2025-03-09 02:29:50,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:50,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:29:50,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:29:50,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:50,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342653022] [2025-03-09 02:29:50,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:50,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:50,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:50,133 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-09 02:29:50,135 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-09 02:29:50,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:29:50,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:29:50,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:50,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:50,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:29:50,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:50,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414011544] [2025-03-09 02:29:50,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342653022] [2025-03-09 02:29:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342653022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:50,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:29:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47888654] [2025-03-09 02:29:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:29:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:50,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:29:50,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:29:50,588 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:50,999 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-03-09 02:29:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:29:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 02:29:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:50,999 INFO L225 Difference]: With dead ends: 82 [2025-03-09 02:29:50,999 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:29:51,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:29:51,000 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 81 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:51,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:29:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:29:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2025-03-09 02:29:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-09 02:29:51,004 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2025-03-09 02:29:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-09 02:29:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-09 02:29:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:29:51,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:51,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:51,011 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-09 02:29:51,205 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,SelfDestructingSolverStorable15 [2025-03-09 02:29:51,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:51,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1332827965, now seen corresponding path program 1 times [2025-03-09 02:29:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:51,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416126148] [2025-03-09 02:29:51,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:51,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:29:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:29:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002630536] [2025-03-09 02:29:51,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:51,222 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-09 02:29:51,223 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-09 02:29:51,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:29:51,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:29:51,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:51,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:51,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:29:51,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:51,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:29:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416126148] [2025-03-09 02:29:51,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002630536] [2025-03-09 02:29:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002630536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:29:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:29:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:29:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585936946] [2025-03-09 02:29:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:29:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:51,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:29:51,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:29:51,588 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:53,309 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-03-09 02:29:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:29:53,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-09 02:29:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:53,310 INFO L225 Difference]: With dead ends: 81 [2025-03-09 02:29:53,310 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 02:29:53,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:29:53,311 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 77 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:53,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:29:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 02:29:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-03-09 02:29:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.180327868852459) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-03-09 02:29:53,317 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2025-03-09 02:29:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:53,317 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-03-09 02:29:53,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-03-09 02:29:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:29:53,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:53,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:53,323 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-09 02:29:53,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:29:53,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:53,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1203791319, now seen corresponding path program 1 times [2025-03-09 02:29:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837572585] [2025-03-09 02:29:53,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:53,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:29:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:29:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:53,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847247104] [2025-03-09 02:29:53,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:53,531 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-09 02:29:53,534 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-09 02:29:53,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:29:53,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:29:53,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:53,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:53,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:29:53,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:54,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:29:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837572585] [2025-03-09 02:29:54,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847247104] [2025-03-09 02:29:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847247104] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:29:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:29:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-09 02:29:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203082740] [2025-03-09 02:29:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:29:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:29:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:54,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:29:54,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:29:54,675 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:55,024 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-03-09 02:29:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:29:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-09 02:29:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:55,025 INFO L225 Difference]: With dead ends: 75 [2025-03-09 02:29:55,025 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 02:29:55,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:29:55,026 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:55,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 45 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:29:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 02:29:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-03-09 02:29:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:29:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-09 02:29:55,032 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 34 [2025-03-09 02:29:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:55,033 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-09 02:29:55,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:29:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-09 02:29:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:29:55,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:55,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:55,042 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-09 02:29:55,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:55,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:55,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1337174782, now seen corresponding path program 1 times [2025-03-09 02:29:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330520088] [2025-03-09 02:29:55,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:29:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:29:55,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:55,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123537254] [2025-03-09 02:29:55,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:55,256 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-09 02:29:55,257 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-09 02:29:55,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:29:55,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:29:55,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:55,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:55,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:29:55,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:55,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:29:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:29:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:29:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330520088] [2025-03-09 02:29:56,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:29:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123537254] [2025-03-09 02:29:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123537254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:29:56,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:29:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-03-09 02:29:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278795467] [2025-03-09 02:29:56,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:29:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:29:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:29:56,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:29:56,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:29:56,449 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:29:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:29:58,380 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2025-03-09 02:29:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 02:29:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-09 02:29:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:29:58,381 INFO L225 Difference]: With dead ends: 104 [2025-03-09 02:29:58,381 INFO L226 Difference]: Without dead ends: 102 [2025-03-09 02:29:58,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:29:58,382 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 68 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:29:58,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 123 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:29:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-09 02:29:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-03-09 02:29:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 84 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:29:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-03-09 02:29:58,387 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 35 [2025-03-09 02:29:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:29:58,387 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-03-09 02:29:58,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:29:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-03-09 02:29:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:29:58,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:29:58,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:29:58,395 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-09 02:29:58,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:58,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:29:58,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:29:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1497254713, now seen corresponding path program 1 times [2025-03-09 02:29:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:29:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784950214] [2025-03-09 02:29:58,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:29:58,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:29:58,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:29:58,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:58,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:29:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494633255] [2025-03-09 02:29:58,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:29:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:29:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:29:58,605 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-09 02:29:58,607 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-09 02:29:58,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:29:58,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:29:58,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:29:58,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:29:58,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:29:58,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:29:58,961 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-09 02:29:58,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:30:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784950214] [2025-03-09 02:30:01,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:30:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494633255] [2025-03-09 02:30:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494633255] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:01,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:30:01,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-09 02:30:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088712607] [2025-03-09 02:30:01,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:30:01,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:30:01,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:01,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:30:01,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:30:01,268 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:30:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:04,252 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2025-03-09 02:30:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:30:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-09 02:30:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:04,253 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:30:04,253 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:30:04,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:30:04,254 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:04,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 02:30:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:30:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 02:30:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 84 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-03-09 02:30:04,262 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 36 [2025-03-09 02:30:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:04,263 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-03-09 02:30:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:30:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-03-09 02:30:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:30:04,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:04,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:04,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:30:04,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:04,464 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 829744156, now seen corresponding path program 1 times [2025-03-09 02:30:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997666199] [2025-03-09 02:30:04,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:04,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:30:04,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:30:04,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:30:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84657385] [2025-03-09 02:30:04,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:04,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:30:04,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:30:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:30:04,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:04,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:04,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:30:04,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:30:04,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:30:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997666199] [2025-03-09 02:30:07,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:30:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84657385] [2025-03-09 02:30:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84657385] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:07,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:30:07,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-09 02:30:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390102464] [2025-03-09 02:30:07,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:30:07,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:30:07,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:07,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:30:07,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:30:07,601 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:30:13,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:30:16,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:30:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:16,783 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-03-09 02:30:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:30:16,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-09 02:30:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:16,784 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:30:16,784 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:30:16,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:30:16,785 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:16,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-09 02:30:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:30:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 02:30:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 84 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-03-09 02:30:16,790 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 37 [2025-03-09 02:30:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:16,791 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-03-09 02:30:16,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:30:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-03-09 02:30:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:30:16,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:16,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:16,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:30:16,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 02:30:16,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -832222282, now seen corresponding path program 1 times [2025-03-09 02:30:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:16,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373855022] [2025-03-09 02:30:16,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:16,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:30:17,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:30:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373855022] [2025-03-09 02:30:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373855022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:30:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:30:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:30:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064539143] [2025-03-09 02:30:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:30:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:30:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:17,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:30:17,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:30:17,086 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:30:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:17,128 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-03-09 02:30:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:30:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-09 02:30:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:17,129 INFO L225 Difference]: With dead ends: 94 [2025-03-09 02:30:17,129 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 02:30:17,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:30:17,130 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:17,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:30:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 02:30:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-03-09 02:30:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1625) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-03-09 02:30:17,134 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 43 [2025-03-09 02:30:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:17,135 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-03-09 02:30:17,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:30:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-03-09 02:30:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:30:17,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:17,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:17,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:30:17,135 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -29086976, now seen corresponding path program 1 times [2025-03-09 02:30:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447581857] [2025-03-09 02:30:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:17,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:30:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:30:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447581857] [2025-03-09 02:30:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447581857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:30:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:30:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:30:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253514527] [2025-03-09 02:30:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:30:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:30:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:17,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:30:17,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:30:17,194 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:30:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:17,220 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-03-09 02:30:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:30:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-09 02:30:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:17,220 INFO L225 Difference]: With dead ends: 95 [2025-03-09 02:30:17,220 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 02:30:17,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:30:17,221 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:17,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:30:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 02:30:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-03-09 02:30:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-03-09 02:30:17,227 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2025-03-09 02:30:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-03-09 02:30:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:30:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-03-09 02:30:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:30:17,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:17,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:17,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:30:17,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -599143055, now seen corresponding path program 1 times [2025-03-09 02:30:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868293628] [2025-03-09 02:30:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:30:17,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:30:17,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868293628] [2025-03-09 02:30:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868293628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25276141] [2025-03-09 02:30:17,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:17,297 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:30:17,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:30:17,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:30:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:30:17,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25276141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:30:17,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:30:17,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 02:30:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508993668] [2025-03-09 02:30:17,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:30:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:30:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:17,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:30:17,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:30:17,466 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:30:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:17,612 INFO L93 Difference]: Finished difference Result 233 states and 274 transitions. [2025-03-09 02:30:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:30:17,613 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2025-03-09 02:30:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:17,614 INFO L225 Difference]: With dead ends: 233 [2025-03-09 02:30:17,614 INFO L226 Difference]: Without dead ends: 231 [2025-03-09 02:30:17,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:30:17,615 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 282 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:17,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 142 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:30:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-09 02:30:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 199. [2025-03-09 02:30:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 182 states have (on average 1.1538461538461537) internal successors, (210), 187 states have internal predecessors, (210), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:30:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2025-03-09 02:30:17,625 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 47 [2025-03-09 02:30:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2025-03-09 02:30:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.166666666666666) internal successors, (110), 13 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:30:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2025-03-09 02:30:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:30:17,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:17,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:17,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:30:17,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 02:30:17,826 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:17,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1053279794, now seen corresponding path program 1 times [2025-03-09 02:30:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863204376] [2025-03-09 02:30:17,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:17,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:30:17,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:30:17,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863204376] [2025-03-09 02:30:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863204376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33483291] [2025-03-09 02:30:17,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:17,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:17,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:30:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:30:17,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:30:17,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:17,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:17,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:30:17,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33483291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:30:17,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:30:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 02:30:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723463240] [2025-03-09 02:30:17,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:30:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:30:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:17,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:30:17,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:30:17,984 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:18,077 INFO L93 Difference]: Finished difference Result 288 states and 340 transitions. [2025-03-09 02:30:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:30:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2025-03-09 02:30:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:18,079 INFO L225 Difference]: With dead ends: 288 [2025-03-09 02:30:18,079 INFO L226 Difference]: Without dead ends: 287 [2025-03-09 02:30:18,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:30:18,080 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 135 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:18,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 87 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:30:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-09 02:30:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2025-03-09 02:30:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 265 states have (on average 1.1433962264150943) internal successors, (303), 270 states have internal predecessors, (303), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 02:30:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 331 transitions. [2025-03-09 02:30:18,097 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 331 transitions. Word has length 47 [2025-03-09 02:30:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 331 transitions. [2025-03-09 02:30:18,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 331 transitions. [2025-03-09 02:30:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:30:18,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:18,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:18,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 02:30:18,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 02:30:18,298 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:18,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1393565531, now seen corresponding path program 1 times [2025-03-09 02:30:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997081231] [2025-03-09 02:30:18,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:18,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:30:18,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:30:18,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:18,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997081231] [2025-03-09 02:30:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997081231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447531534] [2025-03-09 02:30:18,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:18,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:18,354 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:18,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:30:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:30:18,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:30:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:18,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:30:18,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:18,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447531534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:30:18,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:30:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 02:30:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746191814] [2025-03-09 02:30:18,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:30:18,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:30:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:18,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:30:18,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:30:18,564 INFO L87 Difference]: Start difference. First operand 286 states and 331 transitions. Second operand has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:30:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:18,710 INFO L93 Difference]: Finished difference Result 294 states and 340 transitions. [2025-03-09 02:30:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:30:18,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-03-09 02:30:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:18,711 INFO L225 Difference]: With dead ends: 294 [2025-03-09 02:30:18,712 INFO L226 Difference]: Without dead ends: 293 [2025-03-09 02:30:18,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:30:18,712 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 254 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:18,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 129 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:30:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-09 02:30:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 281. [2025-03-09 02:30:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.1346153846153846) internal successors, (295), 265 states have internal predecessors, (295), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 02:30:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 323 transitions. [2025-03-09 02:30:18,726 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 323 transitions. Word has length 48 [2025-03-09 02:30:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:18,726 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 323 transitions. [2025-03-09 02:30:18,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:30:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 323 transitions. [2025-03-09 02:30:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:30:18,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:18,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:18,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:30:18,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 02:30:18,927 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:18,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1708064772, now seen corresponding path program 1 times [2025-03-09 02:30:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-09 02:30:18,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:18,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:30:18,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:30:18,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:18,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-09 02:30:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254787401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123935876] [2025-03-09 02:30:18,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:18,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:18,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:18,989 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:18,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:30:19,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:30:19,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:30:19,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:19,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:30:19,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:19,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123935876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:30:19,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:30:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 02:30:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816639156] [2025-03-09 02:30:19,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:30:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:30:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:19,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:30:19,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:30:19,120 INFO L87 Difference]: Start difference. First operand 281 states and 323 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:19,199 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2025-03-09 02:30:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:30:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-03-09 02:30:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:19,200 INFO L225 Difference]: With dead ends: 287 [2025-03-09 02:30:19,200 INFO L226 Difference]: Without dead ends: 286 [2025-03-09 02:30:19,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:30:19,201 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:19,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 88 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:30:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-09 02:30:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 271. [2025-03-09 02:30:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 252 states have (on average 1.1150793650793651) internal successors, (281), 257 states have internal predecessors, (281), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:30:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2025-03-09 02:30:19,214 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 48 [2025-03-09 02:30:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:19,214 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2025-03-09 02:30:19,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:30:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2025-03-09 02:30:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:30:19,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:30:19,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:19,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:30:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:19,415 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 02:30:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:30:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash -9503481, now seen corresponding path program 1 times [2025-03-09 02:30:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:30:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528125445] [2025-03-09 02:30:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:30:19,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:30:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:30:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:19,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:30:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528125445] [2025-03-09 02:30:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528125445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:30:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878605305] [2025-03-09 02:30:19,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:30:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:30:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:30:19,499 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:30:19,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:30:19,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:30:19,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:30:19,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:30:19,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:30:19,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:30:19,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:30:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:30:19,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:30:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:30:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878605305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:30:19,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:30:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2025-03-09 02:30:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008368096] [2025-03-09 02:30:19,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:30:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:30:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:30:19,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:30:19,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:30:19,641 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:30:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:30:19,694 INFO L93 Difference]: Finished difference Result 279 states and 311 transitions. [2025-03-09 02:30:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:30:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-09 02:30:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:30:19,695 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:30:19,695 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:30:19,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:30:19,696 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:30:19,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 297 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:30:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:30:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:30:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:30:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:30:19,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2025-03-09 02:30:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:30:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:30:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:30:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:30:19,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:30:19,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-09 02:30:19,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-09 02:30:19,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-09 02:30:19,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:30:19,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 02:30:19,904 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:30:19,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:30:20,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:30:20,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:30:20 BoogieIcfgContainer [2025-03-09 02:30:20,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:30:20,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:30:20,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:30:20,581 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:30:20,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:29:46" (3/4) ... [2025-03-09 02:30:20,583 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:30:20,591 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:30:20,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-09 02:30:20,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:30:20,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:30:20,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:30:20,657 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:30:20,657 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:30:20,657 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:30:20,658 INFO L158 Benchmark]: Toolchain (without parser) took 34419.31ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.2MB in the beginning and 154.2MB in the end (delta: -42.0MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,659 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:30:20,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.73ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.75ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:30:20,660 INFO L158 Benchmark]: Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,660 INFO L158 Benchmark]: IcfgBuilder took 274.36ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 84.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,660 INFO L158 Benchmark]: TraceAbstraction took 33860.86ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 84.0MB in the beginning and 160.3MB in the end (delta: -76.3MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,660 INFO L158 Benchmark]: Witness Printer took 76.47ms. Allocated memory is still 218.1MB. Free memory was 160.3MB in the beginning and 154.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:30:20,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.73ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.75ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 274.36ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 84.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33860.86ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 84.0MB in the beginning and 160.3MB in the end (delta: -76.3MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 76.47ms. Allocated memory is still 218.1MB. Free memory was 160.3MB in the beginning and 154.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 64 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1763 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1744 mSDsluCounter, 2504 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1665 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2109 IncrementalHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 839 mSDtfsCounter, 2109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 804 SyntacticMatches, 7 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=25, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 124 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1345 NumberOfCodeBlocks, 1345 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1468 ConstructedInterpolants, 19 QuantifiedInterpolants, 10238 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 44 InterpolantComputations, 22 PerfectInterpolantSequences, 210/434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 41]: Location Invariant Derived location invariant: (((((((((((((0 <= (a + 2147483648)) && (a <= 2147483647)) && (1 <= y)) && (x <= 2147483647)) && (0 <= ((__int128) x + 2147483648))) && (1 <= b)) && (b <= 2147483647)) && (counter == 0)) && (z == 0)) && (y <= 2147483647)) || (((((((((((((((0 <= (a + 2147483648)) && ((((__int128) 3 * x) + z) <= 9223372036854775807)) && (a <= 2147483647)) && (0 <= ((__int128) 2305843009213693952 + x))) && (x <= 2305843009213693951)) && (((__int128) x * y) <= 9223372036854775807)) && (1 <= b)) && (b <= 2147483647)) && (0 <= ((__int128) (9223372036854775808U + x) + z))) && (0 <= (9223372036854775808U + ((__int128) x * y)))) && (0 <= ((__int128) y + 2147483648))) && (y <= 2147483647)) && (counter == 2)) && (((__int128) x + z) <= 9223372036854775807)) && (0 <= ((((__int128) 3 * x) + 9223372036854775808U) + z)))) || ((((((((((((((((0 <= (a + 2147483648)) && ((z + ((__int128) x * y)) <= 9223372036854775807)) && (a <= 2147483647)) && (0 <= ((__int128) 2305843009213693952 + x))) && (0 <= y)) && (x <= 2305843009213693951)) && (1 <= b)) && (((x >= 0) ? (x % 2) : ((x % 2) + 2)) == 0)) && (b <= 2147483647)) && (0 <= ((__int128) (9223372036854775808U + x) + z))) && (0 <= (9223372036854775808U + ((__int128) x * y)))) && (0 <= ((((((((__int128) -1 * x) >= 0) ? (((__int128) -1 * x) / 2) : ((((__int128) -1 * x) / 2) - 1)) * y) * 2) + ((((__int128) -1 * x) >= 0) ? (((__int128) -1 * x) / 2) : ((((__int128) -1 * x) / 2) - 1))) + 9223372036854775807))) && (y <= 2147483647)) && (0 <= ((9223372036854775808U + z) + ((__int128) x * y)))) && (counter == 2)) && (((__int128) x + z) <= 9223372036854775807))) || (((((((((((((0 <= (a + 2147483648)) && (x <= 4294967294)) && (a <= 2147483647)) && (z <= 2147483647)) && (0 <= ((__int128) x + 4294967296))) && (0 <= ((__int128) z + 2147483648))) && (0 <= y)) && (1 <= counter)) && (1 <= b)) && (((x >= 0) ? (x % 2) : ((x % 2) + 2)) == 0)) && (b <= 2147483647)) && (y <= 2147483647)) && (counter <= 2))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:30:20,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE