./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound1.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 1e1d72742850b95338b71e8d041fa264ac4d7956cbe86d6603297a369e94cb76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:51:23,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:51:23,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:51:23,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:51:23,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:51:23,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:51:23,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:51:23,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:51:23,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:51:23,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:51:23,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:51:23,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:51:23,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:51:23,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:51:23,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:51:23,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:51:23,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:51:23,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:51:23,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:51:23,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:51:23,687 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 -> 1e1d72742850b95338b71e8d041fa264ac4d7956cbe86d6603297a369e94cb76 [2025-03-04 10:51:23,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:51:23,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:51:23,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:51:23,925 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:51:23,925 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:51:23,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound1.c [2025-03-04 10:51:25,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a7cd028/3d27471dacf6459d88e78617381bdcbf/FLAGc930933d8 [2025-03-04 10:51:25,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:51:25,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound1.c [2025-03-04 10:51:25,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a7cd028/3d27471dacf6459d88e78617381bdcbf/FLAGc930933d8 [2025-03-04 10:51:25,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a7cd028/3d27471dacf6459d88e78617381bdcbf [2025-03-04 10:51:25,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:51:25,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:51:25,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:51:25,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:51:25,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:51:25,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be4c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25, skipping insertion in model container [2025-03-04 10:51:25,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:51:25,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:51:25,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:51:25,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:51:25,778 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:51:25,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25 WrapperNode [2025-03-04 10:51:25,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:51:25,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:51:25,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:51:25,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:51:25,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,810 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2025-03-04 10:51:25,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:51:25,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:51:25,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:51:25,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:51:25,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,835 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-04 10:51:25,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:51:25,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:51:25,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:51:25,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:51:25,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (1/1) ... [2025-03-04 10:51:25,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:51:25,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:25,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:51:25,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:51:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:51:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:51:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:51:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:51:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:51:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:51:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:51:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:51:25,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:51:25,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:51:26,223 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 10:51:26,223 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:51:26,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:51:26,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:51:26,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:51:26 BoogieIcfgContainer [2025-03-04 10:51:26,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:51:26,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:51:26,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:51:26,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:51:26,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:51:25" (1/3) ... [2025-03-04 10:51:26,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df28496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:51:26, skipping insertion in model container [2025-03-04 10:51:26,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:51:25" (2/3) ... [2025-03-04 10:51:26,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df28496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:51:26, skipping insertion in model container [2025-03-04 10:51:26,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:51:26" (3/3) ... [2025-03-04 10:51:26,242 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2025-03-04 10:51:26,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:51:26,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_valuebound1.c that has 3 procedures, 140 locations, 1 initial locations, 1 loop locations, and 58 error locations. [2025-03-04 10:51:26,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:51:26,303 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;@f42aa20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:51:26,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-04 10:51:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.84) internal successors, (138), 133 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:51:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:51:26,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:26,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:26,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:26,317 INFO L85 PathProgramCache]: Analyzing trace with hash 234381216, now seen corresponding path program 1 times [2025-03-04 10:51:26,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:26,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501409973] [2025-03-04 10:51:26,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:26,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:26,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:26,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:26,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:51:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501409973] [2025-03-04 10:51:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501409973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340354136] [2025-03-04 10:51:26,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:26,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:26,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:26,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:26,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:51:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:26,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:26,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:26,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:26,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 10:51:26,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:51:26,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340354136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 10:51:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183894967] [2025-03-04 10:51:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:26,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:51:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:51:26,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:51:26,482 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.84) internal successors, (138), 133 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:26,499 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2025-03-04 10:51:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:51:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 10:51:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:26,507 INFO L225 Difference]: With dead ends: 276 [2025-03-04 10:51:26,507 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 10:51:26,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-04 10:51:26,511 INFO L435 NwaCegarLoop]: 142 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, 142 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-04 10:51:26,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 10:51:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-04 10:51:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 127 states have internal predecessors, (129), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2025-03-04 10:51:26,536 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 14 [2025-03-04 10:51:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:26,537 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2025-03-04 10:51:26,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:51:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2025-03-04 10:51:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:51:26,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:26,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:26,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:51:26,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:51:26,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 37897502, now seen corresponding path program 1 times [2025-03-04 10:51:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420241584] [2025-03-04 10:51:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:26,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:51:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:51:26,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:26,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420241584] [2025-03-04 10:51:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420241584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920644979] [2025-03-04 10:51:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:26,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:26,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:26,798 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04 10:51:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:26,902 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2025-03-04 10:51:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 14 [2025-03-04 10:51:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:26,903 INFO L225 Difference]: With dead ends: 133 [2025-03-04 10:51:26,903 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 10:51:26,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:26,904 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 88 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:26,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 83 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 10:51:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 10:51:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 123 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2025-03-04 10:51:26,910 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 14 [2025-03-04 10:51:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:26,911 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2025-03-04 10:51:26,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04 10:51:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2025-03-04 10:51:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:51:26,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:26,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:26,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:51:26,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822655, now seen corresponding path program 1 times [2025-03-04 10:51:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853924697] [2025-03-04 10:51:26,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:26,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:51:26,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:51:26,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:26,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853924697] [2025-03-04 10:51:26,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853924697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:26,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:26,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216266400] [2025-03-04 10:51:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:26,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:26,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:26,954 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 10:51:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:27,051 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2025-03-04 10:51:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2025-03-04 10:51:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:27,052 INFO L225 Difference]: With dead ends: 129 [2025-03-04 10:51:27,052 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:51:27,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:27,053 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 87 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:27,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 83 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:51:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 10:51:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.7285714285714286) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2025-03-04 10:51:27,060 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 15 [2025-03-04 10:51:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:27,060 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2025-03-04 10:51:27,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 10:51:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2025-03-04 10:51:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:51:27,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:27,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:27,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:51:27,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:27,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2059764028, now seen corresponding path program 1 times [2025-03-04 10:51:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041300881] [2025-03-04 10:51:27,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:27,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:51:27,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:51:27,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041300881] [2025-03-04 10:51:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041300881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451671914] [2025-03-04 10:51:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:27,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:27,120 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04 10:51:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:27,284 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2025-03-04 10:51:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 16 [2025-03-04 10:51:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:27,285 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:51:27,285 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:51:27,285 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-04 10:51:27,285 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 169 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:27,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 78 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:51:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 10:51:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2025-03-04 10:51:27,290 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 16 [2025-03-04 10:51:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2025-03-04 10:51:27,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04 10:51:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2025-03-04 10:51:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:51:27,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:27,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:27,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:51:27,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:27,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -571824483, now seen corresponding path program 1 times [2025-03-04 10:51:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911084119] [2025-03-04 10:51:27,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:51:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:51:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911084119] [2025-03-04 10:51:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911084119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535894943] [2025-03-04 10:51:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:27,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:27,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:27,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:27,347 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 10:51:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:27,473 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2025-03-04 10:51:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 17 [2025-03-04 10:51:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:27,474 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:51:27,475 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 10:51:27,475 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-04 10:51:27,475 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 168 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:27,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 78 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 10:51:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 10:51:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2025-03-04 10:51:27,481 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 17 [2025-03-04 10:51:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:27,481 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2025-03-04 10:51:27,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 10:51:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2025-03-04 10:51:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:51:27,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:27,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:51:27,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -546689703, now seen corresponding path program 1 times [2025-03-04 10:51:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761134873] [2025-03-04 10:51:27,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:27,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:51:27,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:51:27,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:27,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412186673] [2025-03-04 10:51:27,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:27,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:27,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:27,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:51:27,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:51:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:51:27,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:27,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:51:27,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:27,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:27,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761134873] [2025-03-04 10:51:27,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412186673] [2025-03-04 10:51:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412186673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:27,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:27,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847098174] [2025-03-04 10:51:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:27,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:27,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:27,537 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:27,585 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2025-03-04 10:51:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 10:51:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:27,586 INFO L225 Difference]: With dead ends: 183 [2025-03-04 10:51:27,586 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 10:51:27,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:27,587 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:27,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 10:51:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2025-03-04 10:51:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 136 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:51:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2025-03-04 10:51:27,593 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 18 [2025-03-04 10:51:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:27,594 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2025-03-04 10:51:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2025-03-04 10:51:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:51:27,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:27,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:27,600 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-04 10:51:27,794 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,SelfDestructingSolverStorable5 [2025-03-04 10:51:27,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1382791785, now seen corresponding path program 1 times [2025-03-04 10:51:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714659944] [2025-03-04 10:51:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:27,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:51:27,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:51:27,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:27,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047292492] [2025-03-04 10:51:27,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:27,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:27,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:51:27,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:51:27,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:51:27,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:27,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:27,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:51:27,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:27,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714659944] [2025-03-04 10:51:27,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047292492] [2025-03-04 10:51:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047292492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:51:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496298617] [2025-03-04 10:51:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:27,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:51:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:27,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:51:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:27,848 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:27,895 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2025-03-04 10:51:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:51:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:51:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:27,897 INFO L225 Difference]: With dead ends: 239 [2025-03-04 10:51:27,897 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 10:51:27,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:51:27,897 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:27,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 215 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 10:51:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 191. [2025-03-04 10:51:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 140 states have (on average 1.6571428571428573) internal successors, (232), 183 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2025-03-04 10:51:27,908 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 20 [2025-03-04 10:51:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2025-03-04 10:51:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2025-03-04 10:51:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:51:27,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:27,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:27,916 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-04 10:51:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1718008363, now seen corresponding path program 1 times [2025-03-04 10:51:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694993638] [2025-03-04 10:51:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:28,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:51:28,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:51:28,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118212412] [2025-03-04 10:51:28,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:28,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:28,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:51:28,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:51:28,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:51:28,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:28,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:28,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:28,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694993638] [2025-03-04 10:51:28,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118212412] [2025-03-04 10:51:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118212412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726573773] [2025-03-04 10:51:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:28,185 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:28,311 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2025-03-04 10:51:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 10:51:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:28,312 INFO L225 Difference]: With dead ends: 257 [2025-03-04 10:51:28,313 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 10:51:28,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-04 10:51:28,313 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 121 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:28,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 228 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 10:51:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 192. [2025-03-04 10:51:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 184 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2025-03-04 10:51:28,337 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 22 [2025-03-04 10:51:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:28,337 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2025-03-04 10:51:28,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2025-03-04 10:51:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:51:28,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:28,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:28,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1718651625, now seen corresponding path program 1 times [2025-03-04 10:51:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900404959] [2025-03-04 10:51:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:28,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:51:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:51:28,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:28,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330695965] [2025-03-04 10:51:28,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:28,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:28,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:51:28,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:51:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:51:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:28,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:28,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:28,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900404959] [2025-03-04 10:51:28,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330695965] [2025-03-04 10:51:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330695965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865683036] [2025-03-04 10:51:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:28,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:28,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:28,598 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:28,713 INFO L93 Difference]: Finished difference Result 256 states and 309 transitions. [2025-03-04 10:51:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:28,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-04 10:51:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:28,714 INFO L225 Difference]: With dead ends: 256 [2025-03-04 10:51:28,714 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 10:51:28,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-04 10:51:28,715 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 119 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:28,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 231 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 10:51:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2025-03-04 10:51:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.6338028169014085) internal successors, (232), 185 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 242 transitions. [2025-03-04 10:51:28,721 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 242 transitions. Word has length 23 [2025-03-04 10:51:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:28,721 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 242 transitions. [2025-03-04 10:51:28,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 242 transitions. [2025-03-04 10:51:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:51:28,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:28,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:28,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:51:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1738592749, now seen corresponding path program 1 times [2025-03-04 10:51:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762733486] [2025-03-04 10:51:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:28,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:51:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:51:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064555446] [2025-03-04 10:51:28,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:28,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:28,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:28,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:51:28,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:51:28,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:51:28,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:28,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:28,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:28,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762733486] [2025-03-04 10:51:28,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064555446] [2025-03-04 10:51:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064555446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:28,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369262092] [2025-03-04 10:51:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:28,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:28,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:28,979 INFO L87 Difference]: Start difference. First operand 193 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:29,082 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2025-03-04 10:51:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 10:51:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:29,083 INFO L225 Difference]: With dead ends: 252 [2025-03-04 10:51:29,083 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 10:51:29,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-04 10:51:29,084 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 166 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:29,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 251 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 10:51:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 193. [2025-03-04 10:51:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.6126760563380282) internal successors, (229), 185 states have internal predecessors, (229), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2025-03-04 10:51:29,090 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 24 [2025-03-04 10:51:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2025-03-04 10:51:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2025-03-04 10:51:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:51:29,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:29,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:29,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:51:29,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:29,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1938199701, now seen corresponding path program 1 times [2025-03-04 10:51:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199480629] [2025-03-04 10:51:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:29,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:51:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:51:29,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496802170] [2025-03-04 10:51:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:29,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:29,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:51:29,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:51:29,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:51:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:29,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:29,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:29,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199480629] [2025-03-04 10:51:29,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496802170] [2025-03-04 10:51:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496802170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375712621] [2025-03-04 10:51:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:29,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:29,358 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:29,441 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2025-03-04 10:51:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:51:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:29,442 INFO L225 Difference]: With dead ends: 250 [2025-03-04 10:51:29,442 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 10:51:29,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-04 10:51:29,443 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:29,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 257 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 10:51:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2025-03-04 10:51:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 142 states have (on average 1.591549295774648) internal successors, (226), 185 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2025-03-04 10:51:29,449 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 25 [2025-03-04 10:51:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:29,449 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2025-03-04 10:51:29,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2025-03-04 10:51:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:51:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:29,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:29,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:51:29,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:29,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -45351343, now seen corresponding path program 1 times [2025-03-04 10:51:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855062745] [2025-03-04 10:51:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:51:29,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:51:29,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:29,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965140770] [2025-03-04 10:51:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:29,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:29,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:29,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:51:29,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:51:29,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:51:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:29,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:29,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:29,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:29,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:29,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855062745] [2025-03-04 10:51:29,715 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:29,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965140770] [2025-03-04 10:51:29,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965140770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:29,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:29,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:29,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477380157] [2025-03-04 10:51:29,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:29,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:29,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:29,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:29,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:29,717 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:29,881 INFO L93 Difference]: Finished difference Result 251 states and 299 transitions. [2025-03-04 10:51:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 10:51:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:29,882 INFO L225 Difference]: With dead ends: 251 [2025-03-04 10:51:29,882 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 10:51:29,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:29,882 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 108 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:29,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 294 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 10:51:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2025-03-04 10:51:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.5724137931034483) internal successors, (228), 188 states have internal predecessors, (228), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 238 transitions. [2025-03-04 10:51:29,889 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 238 transitions. Word has length 26 [2025-03-04 10:51:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:29,889 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 238 transitions. [2025-03-04 10:51:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 238 transitions. [2025-03-04 10:51:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:51:29,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:29,890 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:51:29,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:51:30,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:51:30,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:30,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1405891565, now seen corresponding path program 1 times [2025-03-04 10:51:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551628926] [2025-03-04 10:51:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:30,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:51:30,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:51:30,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:30,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177162861] [2025-03-04 10:51:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:30,104 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:30,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:51:30,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:51:30,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:51:30,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:30,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:30,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:30,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:30,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551628926] [2025-03-04 10:51:30,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177162861] [2025-03-04 10:51:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177162861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087300608] [2025-03-04 10:51:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:30,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:30,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:30,170 INFO L87 Difference]: Start difference. First operand 196 states and 238 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:30,310 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2025-03-04 10:51:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:51:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 10:51:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:30,311 INFO L225 Difference]: With dead ends: 251 [2025-03-04 10:51:30,311 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 10:51:30,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:30,312 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 225 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:30,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 257 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 10:51:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2025-03-04 10:51:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 188 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 235 transitions. [2025-03-04 10:51:30,319 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 235 transitions. Word has length 27 [2025-03-04 10:51:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 235 transitions. [2025-03-04 10:51:30,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 235 transitions. [2025-03-04 10:51:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:51:30,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:30,320 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:51:30,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:51:30,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:30,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash -632965489, now seen corresponding path program 1 times [2025-03-04 10:51:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038936194] [2025-03-04 10:51:30,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:51:30,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:51:30,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215895222] [2025-03-04 10:51:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:30,536 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-04 10:51:30,537 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-04 10:51:30,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:51:30,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:51:30,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:30,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:30,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:51:30,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:30,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038936194] [2025-03-04 10:51:30,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215895222] [2025-03-04 10:51:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215895222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:51:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480609581] [2025-03-04 10:51:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:30,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:30,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:30,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:30,656 INFO L87 Difference]: Start difference. First operand 196 states and 235 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:30,866 INFO L93 Difference]: Finished difference Result 246 states and 293 transitions. [2025-03-04 10:51:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:30,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:51:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:30,867 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:51:30,867 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 10:51:30,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:51:30,868 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 242 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:30,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 211 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 10:51:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 198. [2025-03-04 10:51:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 190 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2025-03-04 10:51:30,873 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 28 [2025-03-04 10:51:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:30,873 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2025-03-04 10:51:30,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2025-03-04 10:51:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:51:30,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:30,873 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:51:30,880 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-04 10:51:31,074 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,SelfDestructingSolverStorable13 [2025-03-04 10:51:31,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:31,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1852906385, now seen corresponding path program 1 times [2025-03-04 10:51:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714444849] [2025-03-04 10:51:31,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:51:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:51:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714444849] [2025-03-04 10:51:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714444849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247481246] [2025-03-04 10:51:31,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:31,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:31,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:31,209 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-04 10:51:31,210 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-04 10:51:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:51:31,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:51:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:31,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:31,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:51:31,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:31,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247481246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:31,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:31,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:51:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084403015] [2025-03-04 10:51:31,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:31,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:31,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:31,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:31,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:31,335 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:31,558 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2025-03-04 10:51:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:31,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-04 10:51:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:31,559 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:51:31,559 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 10:51:31,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:31,560 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 241 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:31,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 191 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 10:51:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 199. [2025-03-04 10:51:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 148 states have (on average 1.527027027027027) internal successors, (226), 191 states have internal predecessors, (226), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2025-03-04 10:51:31,565 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 29 [2025-03-04 10:51:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:31,565 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2025-03-04 10:51:31,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2025-03-04 10:51:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:51:31,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:31,565 INFO L218 NwaCegarLoop]: trace histogram [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-04 10:51:31,570 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-04 10:51:31,765 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,SelfDestructingSolverStorable14 [2025-03-04 10:51:31,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1014488843, now seen corresponding path program 1 times [2025-03-04 10:51:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960039026] [2025-03-04 10:51:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:31,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:51:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:51:31,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:31,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960039026] [2025-03-04 10:51:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960039026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:31,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:31,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:51:31,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34365830] [2025-03-04 10:51:31,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:31,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:31,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:31,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:31,837 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:31,989 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2025-03-04 10:51:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 10:51:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:31,990 INFO L225 Difference]: With dead ends: 199 [2025-03-04 10:51:31,990 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 10:51:31,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:31,991 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:31,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 200 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 10:51:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 10:51:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 189 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2025-03-04 10:51:32,004 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 32 [2025-03-04 10:51:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2025-03-04 10:51:32,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2025-03-04 10:51:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:51:32,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:32,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:32,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:51:32,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1384383117, now seen corresponding path program 1 times [2025-03-04 10:51:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363584439] [2025-03-04 10:51:32,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:32,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:51:32,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:51:32,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:32,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281092904] [2025-03-04 10:51:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:32,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:32,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:32,020 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-04 10:51:32,021 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-04 10:51:32,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:51:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:51:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:32,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:32,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:32,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363584439] [2025-03-04 10:51:32,167 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281092904] [2025-03-04 10:51:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281092904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:32,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:51:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319378006] [2025-03-04 10:51:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:32,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:51:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:32,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:51:32,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:32,168 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-04 10:51:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:32,411 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2025-03-04 10:51:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:51:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 33 [2025-03-04 10:51:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:32,412 INFO L225 Difference]: With dead ends: 238 [2025-03-04 10:51:32,412 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 10:51:32,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:32,413 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 285 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:32,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 123 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 10:51:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2025-03-04 10:51:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 193 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2025-03-04 10:51:32,419 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 33 [2025-03-04 10:51:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2025-03-04 10:51:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-04 10:51:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2025-03-04 10:51:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:51:32,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:32,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:32,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:32,620 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,SelfDestructingSolverStorable16 [2025-03-04 10:51:32,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -33796279, now seen corresponding path program 1 times [2025-03-04 10:51:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444886280] [2025-03-04 10:51:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:51:32,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:51:32,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444886280] [2025-03-04 10:51:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444886280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509176985] [2025-03-04 10:51:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:32,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:32,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:32,653 INFO L87 Difference]: Start difference. First operand 201 states and 234 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:32,834 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2025-03-04 10:51:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-04 10:51:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:32,835 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:32,835 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:32,836 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-04 10:51:32,836 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 92 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:32,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 146 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2025-03-04 10:51:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 194 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2025-03-04 10:51:32,842 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 34 [2025-03-04 10:51:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:32,842 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2025-03-04 10:51:32,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2025-03-04 10:51:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:51:32,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:32,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:51:32,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1047684597, now seen corresponding path program 1 times [2025-03-04 10:51:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727340154] [2025-03-04 10:51:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:32,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:51:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:51:32,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:32,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727340154] [2025-03-04 10:51:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727340154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:32,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:32,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188491765] [2025-03-04 10:51:32,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:32,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:32,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:32,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:32,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:32,874 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,042 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2025-03-04 10:51:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:33,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-04 10:51:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,043 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:33,043 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:33,043 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-04 10:51:33,044 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 159 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 203. [2025-03-04 10:51:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 154 states have (on average 1.4545454545454546) internal successors, (224), 195 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2025-03-04 10:51:33,049 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 35 [2025-03-04 10:51:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,049 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2025-03-04 10:51:33,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:51:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2025-03-04 10:51:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:51:33,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:51:33,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2053735469, now seen corresponding path program 1 times [2025-03-04 10:51:33,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923999551] [2025-03-04 10:51:33,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:51:33,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:51:33,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:33,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923999551] [2025-03-04 10:51:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923999551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653652574] [2025-03-04 10:51:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:33,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:33,092 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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-04 10:51:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,254 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2025-03-04 10:51:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:33,254 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), 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) Word has length 45 [2025-03-04 10:51:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,255 INFO L225 Difference]: With dead ends: 220 [2025-03-04 10:51:33,255 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:51:33,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:33,256 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 304 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 128 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:51:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2025-03-04 10:51:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 204 states have internal predecessors, (234), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 244 transitions. [2025-03-04 10:51:33,262 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 244 transitions. Word has length 45 [2025-03-04 10:51:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,262 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 244 transitions. [2025-03-04 10:51:33,262 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), 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-04 10:51:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2025-03-04 10:51:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:51:33,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:51:33,264 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 758709924, now seen corresponding path program 1 times [2025-03-04 10:51:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717774584] [2025-03-04 10:51:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:51:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:51:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717774584] [2025-03-04 10:51:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717774584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387391560] [2025-03-04 10:51:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:33,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:33,318 INFO L87 Difference]: Start difference. First operand 212 states and 244 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,388 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2025-03-04 10:51:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:33,388 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-03-04 10:51:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,389 INFO L225 Difference]: With dead ends: 212 [2025-03-04 10:51:33,389 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 10:51:33,389 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-04 10:51:33,390 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 149 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 10:51:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 10:51:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 163 states have (on average 1.4233128834355828) internal successors, (232), 203 states have internal predecessors, (232), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2025-03-04 10:51:33,397 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 46 [2025-03-04 10:51:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,397 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2025-03-04 10:51:33,397 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2025-03-04 10:51:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:51:33,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:51:33,398 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1024202654, now seen corresponding path program 1 times [2025-03-04 10:51:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655257427] [2025-03-04 10:51:33,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:51:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:51:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655257427] [2025-03-04 10:51:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655257427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639850087] [2025-03-04 10:51:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:33,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:33,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:33,464 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,523 INFO L93 Difference]: Finished difference Result 226 states and 259 transitions. [2025-03-04 10:51:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-04 10:51:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,524 INFO L225 Difference]: With dead ends: 226 [2025-03-04 10:51:33,524 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 10:51:33,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:33,525 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 310 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 10:51:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2025-03-04 10:51:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.416184971098266) internal successors, (245), 213 states have internal predecessors, (245), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2025-03-04 10:51:33,535 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 48 [2025-03-04 10:51:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,536 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2025-03-04 10:51:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2025-03-04 10:51:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:51:33,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:51:33,536 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 336636291, now seen corresponding path program 1 times [2025-03-04 10:51:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867921394] [2025-03-04 10:51:33,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:51:33,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:51:33,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867921394] [2025-03-04 10:51:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867921394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:33,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531450652] [2025-03-04 10:51:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:33,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:33,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:33,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:33,610 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-04 10:51:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,761 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2025-03-04 10:51:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:51:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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) Word has length 48 [2025-03-04 10:51:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,763 INFO L225 Difference]: With dead ends: 222 [2025-03-04 10:51:33,763 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 10:51:33,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:33,763 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 140 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 169 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 10:51:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-04 10:51:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 213 states have internal predecessors, (244), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2025-03-04 10:51:33,769 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 48 [2025-03-04 10:51:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,769 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2025-03-04 10:51:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-04 10:51:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2025-03-04 10:51:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:51:33,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:51:33,769 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1845790462, now seen corresponding path program 1 times [2025-03-04 10:51:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944896934] [2025-03-04 10:51:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:51:33,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:51:33,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944896934] [2025-03-04 10:51:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944896934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:51:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999030766] [2025-03-04 10:51:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:51:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:33,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:51:33,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:33,816 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:33,874 INFO L93 Difference]: Finished difference Result 258 states and 269 transitions. [2025-03-04 10:51:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:51:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-03-04 10:51:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:33,875 INFO L225 Difference]: With dead ends: 258 [2025-03-04 10:51:33,875 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 10:51:33,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:51:33,876 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 56 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:33,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 10:51:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2025-03-04 10:51:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.3922651933701657) internal successors, (252), 221 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 262 transitions. [2025-03-04 10:51:33,882 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 262 transitions. Word has length 49 [2025-03-04 10:51:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:33,882 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 262 transitions. [2025-03-04 10:51:33,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 262 transitions. [2025-03-04 10:51:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:51:33,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:33,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:51:33,883 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:33,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash -711239066, now seen corresponding path program 1 times [2025-03-04 10:51:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75756807] [2025-03-04 10:51:33,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:51:33,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:51:33,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325934248] [2025-03-04 10:51:33,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:33,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:33,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:33,894 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-04 10:51:33,896 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-04 10:51:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:51:33,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:51:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:33,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:33,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:34,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75756807] [2025-03-04 10:51:34,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325934248] [2025-03-04 10:51:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325934248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:51:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904626677] [2025-03-04 10:51:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:34,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:51:34,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:34,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:51:34,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:51:34,070 INFO L87 Difference]: Start difference. First operand 229 states and 262 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:34,241 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2025-03-04 10:51:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-04 10:51:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:34,243 INFO L225 Difference]: With dead ends: 229 [2025-03-04 10:51:34,243 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 10:51:34,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:51:34,244 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 105 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:34,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 339 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 10:51:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 10:51:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3591160220994476) internal successors, (246), 218 states have internal predecessors, (246), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:51:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2025-03-04 10:51:34,253 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 50 [2025-03-04 10:51:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2025-03-04 10:51:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2025-03-04 10:51:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:51:34,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:34,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:34,260 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-04 10:51:34,455 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,SelfDestructingSolverStorable24 [2025-03-04 10:51:34,455 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:34,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -573574482, now seen corresponding path program 1 times [2025-03-04 10:51:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257208711] [2025-03-04 10:51:34,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:34,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:51:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:51:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838531224] [2025-03-04 10:51:34,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:34,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:34,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:34,467 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-04 10:51:34,469 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-04 10:51:34,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:51:34,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:51:34,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:34,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:51:34,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:34,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:34,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257208711] [2025-03-04 10:51:34,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838531224] [2025-03-04 10:51:34,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838531224] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:34,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:34,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-03-04 10:51:34,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762021015] [2025-03-04 10:51:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:34,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:51:34,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:34,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:51:34,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:34,875 INFO L87 Difference]: Start difference. First operand 226 states and 256 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:35,124 INFO L93 Difference]: Finished difference Result 315 states and 359 transitions. [2025-03-04 10:51:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:51:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2025-03-04 10:51:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:35,125 INFO L225 Difference]: With dead ends: 315 [2025-03-04 10:51:35,125 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 10:51:35,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:51:35,126 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 387 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:35,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 262 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 10:51:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 266. [2025-03-04 10:51:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 220 states have (on average 1.3909090909090909) internal successors, (306), 257 states have internal predecessors, (306), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:51:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 318 transitions. [2025-03-04 10:51:35,133 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 318 transitions. Word has length 51 [2025-03-04 10:51:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 318 transitions. [2025-03-04 10:51:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 318 transitions. [2025-03-04 10:51:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:51:35,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:35,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:35,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:51:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:35,334 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1977408414, now seen corresponding path program 1 times [2025-03-04 10:51:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328322618] [2025-03-04 10:51:35,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:51:35,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:51:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467181928] [2025-03-04 10:51:35,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:35,350 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-04 10:51:35,352 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-04 10:51:35,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:51:35,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:51:35,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:35,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:35,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:51:35,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:35,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328322618] [2025-03-04 10:51:35,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467181928] [2025-03-04 10:51:35,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467181928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:35,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 10:51:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104936196] [2025-03-04 10:51:35,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:35,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:51:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:35,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:51:35,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:51:35,654 INFO L87 Difference]: Start difference. First operand 266 states and 318 transitions. Second operand has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:36,196 INFO L93 Difference]: Finished difference Result 414 states and 506 transitions. [2025-03-04 10:51:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:51:36,196 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2025-03-04 10:51:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:36,197 INFO L225 Difference]: With dead ends: 414 [2025-03-04 10:51:36,197 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 10:51:36,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:51:36,198 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 532 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:36,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 291 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:51:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 10:51:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 316. [2025-03-04 10:51:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 270 states have (on average 1.3777777777777778) internal successors, (372), 305 states have internal predecessors, (372), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 388 transitions. [2025-03-04 10:51:36,207 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 388 transitions. Word has length 54 [2025-03-04 10:51:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:36,208 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 388 transitions. [2025-03-04 10:51:36,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 388 transitions. [2025-03-04 10:51:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:51:36,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:36,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:36,214 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-04 10:51:36,413 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,SelfDestructingSolverStorable26 [2025-03-04 10:51:36,413 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 49437665, now seen corresponding path program 1 times [2025-03-04 10:51:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25661119] [2025-03-04 10:51:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:36,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:51:36,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:51:36,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:36,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:36,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326161194] [2025-03-04 10:51:36,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:36,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:36,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:51:36,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:51:36,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:51:36,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:36,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:36,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:51:36,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:36,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25661119] [2025-03-04 10:51:36,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326161194] [2025-03-04 10:51:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326161194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:36,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:51:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41906760] [2025-03-04 10:51:36,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:36,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:36,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:36,738 INFO L87 Difference]: Start difference. First operand 316 states and 388 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:36,924 INFO L93 Difference]: Finished difference Result 328 states and 396 transitions. [2025-03-04 10:51:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-03-04 10:51:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:36,925 INFO L225 Difference]: With dead ends: 328 [2025-03-04 10:51:36,925 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 10:51:36,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:36,926 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 181 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 354 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 10:51:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 312. [2025-03-04 10:51:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 270 states have (on average 1.3444444444444446) internal successors, (363), 301 states have internal predecessors, (363), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 379 transitions. [2025-03-04 10:51:36,935 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 379 transitions. Word has length 56 [2025-03-04 10:51:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 379 transitions. [2025-03-04 10:51:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 379 transitions. [2025-03-04 10:51:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 10:51:36,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:36,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:36,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:37,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:51:37,136 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:37,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1532567695, now seen corresponding path program 1 times [2025-03-04 10:51:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294689277] [2025-03-04 10:51:37,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:37,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:37,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:51:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:51:37,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617605914] [2025-03-04 10:51:37,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:37,151 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:37,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:51:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:51:37,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:51:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:51:37,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:37,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294689277] [2025-03-04 10:51:37,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617605914] [2025-03-04 10:51:37,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617605914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:37,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:37,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2025-03-04 10:51:37,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183127487] [2025-03-04 10:51:37,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:37,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:51:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:37,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:51:37,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:51:37,567 INFO L87 Difference]: Start difference. First operand 312 states and 379 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:37,746 INFO L93 Difference]: Finished difference Result 312 states and 379 transitions. [2025-03-04 10:51:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2025-03-04 10:51:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:37,747 INFO L225 Difference]: With dead ends: 312 [2025-03-04 10:51:37,747 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 10:51:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:37,748 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 175 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:37,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 192 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 10:51:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-03-04 10:51:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 270 states have (on average 1.3333333333333333) internal successors, (360), 300 states have internal predecessors, (360), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 376 transitions. [2025-03-04 10:51:37,760 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 376 transitions. Word has length 57 [2025-03-04 10:51:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:37,760 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 376 transitions. [2025-03-04 10:51:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 376 transitions. [2025-03-04 10:51:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:51:37,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:37,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:37,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:51:37,962 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1048981922, now seen corresponding path program 1 times [2025-03-04 10:51:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100308778] [2025-03-04 10:51:37,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:51:37,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:51:37,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:37,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175075171] [2025-03-04 10:51:37,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:37,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:37,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:37,976 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:37,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:51:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:51:38,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:51:38,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:38,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:38,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:38,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:38,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100308778] [2025-03-04 10:51:38,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175075171] [2025-03-04 10:51:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175075171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:38,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-03-04 10:51:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247391642] [2025-03-04 10:51:38,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:38,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:38,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:38,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:51:38,103 INFO L87 Difference]: Start difference. First operand 311 states and 376 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:38,246 INFO L93 Difference]: Finished difference Result 339 states and 387 transitions. [2025-03-04 10:51:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2025-03-04 10:51:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:38,248 INFO L225 Difference]: With dead ends: 339 [2025-03-04 10:51:38,248 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 10:51:38,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:51:38,248 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 158 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:38,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 272 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 10:51:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2025-03-04 10:51:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 270 states have (on average 1.3222222222222222) internal successors, (357), 300 states have internal predecessors, (357), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 373 transitions. [2025-03-04 10:51:38,257 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 373 transitions. Word has length 58 [2025-03-04 10:51:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:38,257 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 373 transitions. [2025-03-04 10:51:38,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 373 transitions. [2025-03-04 10:51:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:51:38,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:38,258 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:38,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:51:38,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:38,462 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:38,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1245689692, now seen corresponding path program 1 times [2025-03-04 10:51:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621035215] [2025-03-04 10:51:38,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:51:38,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:51:38,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736808951] [2025-03-04 10:51:38,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:38,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:38,472 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:38,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:51:38,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:51:38,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:51:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:51:38,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:38,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621035215] [2025-03-04 10:51:38,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736808951] [2025-03-04 10:51:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736808951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:38,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 10:51:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164617242] [2025-03-04 10:51:38,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:38,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:38,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:38,810 INFO L87 Difference]: Start difference. First operand 311 states and 373 transitions. Second operand has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:51:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:39,834 INFO L93 Difference]: Finished difference Result 359 states and 429 transitions. [2025-03-04 10:51:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:51:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2025-03-04 10:51:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:39,836 INFO L225 Difference]: With dead ends: 359 [2025-03-04 10:51:39,836 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 10:51:39,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:51:39,836 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 425 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:39,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 316 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:51:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 10:51:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 316. [2025-03-04 10:51:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.3127272727272727) internal successors, (361), 305 states have internal predecessors, (361), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 377 transitions. [2025-03-04 10:51:39,846 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 377 transitions. Word has length 60 [2025-03-04 10:51:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:39,846 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 377 transitions. [2025-03-04 10:51:39,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:51:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 377 transitions. [2025-03-04 10:51:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:51:39,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:39,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:39,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:51:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:40,051 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1221922653, now seen corresponding path program 1 times [2025-03-04 10:51:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715418428] [2025-03-04 10:51:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:51:40,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:51:40,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:40,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979235026] [2025-03-04 10:51:40,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:40,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:40,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:40,064 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:40,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:51:40,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:51:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:51:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:40,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:51:40,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:40,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715418428] [2025-03-04 10:51:40,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979235026] [2025-03-04 10:51:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979235026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:40,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:51:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947862730] [2025-03-04 10:51:40,351 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:40,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:51:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:40,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:51:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:40,352 INFO L87 Difference]: Start difference. First operand 316 states and 377 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:40,762 INFO L93 Difference]: Finished difference Result 326 states and 385 transitions. [2025-03-04 10:51:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:51:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-03-04 10:51:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:40,763 INFO L225 Difference]: With dead ends: 326 [2025-03-04 10:51:40,763 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 10:51:40,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:51:40,764 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 211 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:40,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 359 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 10:51:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 314. [2025-03-04 10:51:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 275 states have (on average 1.298181818181818) internal successors, (357), 303 states have internal predecessors, (357), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 373 transitions. [2025-03-04 10:51:40,775 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 373 transitions. Word has length 60 [2025-03-04 10:51:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:40,775 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 373 transitions. [2025-03-04 10:51:40,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 373 transitions. [2025-03-04 10:51:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:51:40,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:40,775 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:40,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:40,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 10:51:40,976 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -38325148, now seen corresponding path program 1 times [2025-03-04 10:51:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:40,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165505477] [2025-03-04 10:51:40,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:40,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:40,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:51:40,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:51:40,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165505477] [2025-03-04 10:51:41,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165505477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209767489] [2025-03-04 10:51:41,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:41,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:41,041 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:41,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:51:41,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:51:41,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:51:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:41,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:41,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:41,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209767489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:41,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-04 10:51:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612551855] [2025-03-04 10:51:41,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:51:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:41,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:51:41,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:51:41,170 INFO L87 Difference]: Start difference. First operand 314 states and 373 transitions. Second operand has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:51:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:41,362 INFO L93 Difference]: Finished difference Result 318 states and 378 transitions. [2025-03-04 10:51:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:51:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 61 [2025-03-04 10:51:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:41,364 INFO L225 Difference]: With dead ends: 318 [2025-03-04 10:51:41,364 INFO L226 Difference]: Without dead ends: 316 [2025-03-04 10:51:41,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:51:41,364 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 322 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:41,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 308 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-04 10:51:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2025-03-04 10:51:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 275 states have (on average 1.2727272727272727) internal successors, (350), 301 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:51:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 366 transitions. [2025-03-04 10:51:41,373 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 366 transitions. Word has length 61 [2025-03-04 10:51:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 366 transitions. [2025-03-04 10:51:41,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.1) internal successors, (121), 11 states have internal predecessors, (121), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:51:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 366 transitions. [2025-03-04 10:51:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:51:41,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:41,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:41,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:41,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:51:41,578 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -775103349, now seen corresponding path program 1 times [2025-03-04 10:51:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139444107] [2025-03-04 10:51:41,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:41,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:51:41,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:51:41,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:41,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:41,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344308684] [2025-03-04 10:51:41,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:41,588 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:41,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:51:41,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:51:41,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:51:41,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:41,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:41,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:51:41,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:41,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139444107] [2025-03-04 10:51:42,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344308684] [2025-03-04 10:51:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344308684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:42,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 10:51:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788572229] [2025-03-04 10:51:42,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:51:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:51:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:51:42,050 INFO L87 Difference]: Start difference. First operand 312 states and 366 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:42,664 INFO L93 Difference]: Finished difference Result 563 states and 665 transitions. [2025-03-04 10:51:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:51:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2025-03-04 10:51:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:42,666 INFO L225 Difference]: With dead ends: 563 [2025-03-04 10:51:42,666 INFO L226 Difference]: Without dead ends: 561 [2025-03-04 10:51:42,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:51:42,666 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 838 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:42,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 593 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:51:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-04 10:51:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 454. [2025-03-04 10:51:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 413 states have (on average 1.3220338983050848) internal successors, (546), 439 states have internal predecessors, (546), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:51:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 570 transitions. [2025-03-04 10:51:42,680 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 570 transitions. Word has length 61 [2025-03-04 10:51:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 570 transitions. [2025-03-04 10:51:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 570 transitions. [2025-03-04 10:51:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:51:42,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:42,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:42,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:42,882 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:42,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1741600027, now seen corresponding path program 1 times [2025-03-04 10:51:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444772809] [2025-03-04 10:51:42,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:42,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:51:42,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:51:42,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:42,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956695272] [2025-03-04 10:51:42,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:42,891 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:42,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:51:42,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:51:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:51:42,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:42,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:42,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:51:42,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:43,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444772809] [2025-03-04 10:51:43,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956695272] [2025-03-04 10:51:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956695272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:43,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 10:51:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922282052] [2025-03-04 10:51:43,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:43,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:51:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:43,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:51:43,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:51:43,488 INFO L87 Difference]: Start difference. First operand 454 states and 570 transitions. Second operand has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 23 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:45,661 INFO L93 Difference]: Finished difference Result 540 states and 667 transitions. [2025-03-04 10:51:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:51:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 23 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2025-03-04 10:51:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:45,662 INFO L225 Difference]: With dead ends: 540 [2025-03-04 10:51:45,663 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 10:51:45,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1682, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:51:45,664 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 575 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:45,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 419 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 10:51:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 10:51:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 436. [2025-03-04 10:51:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 395 states have (on average 1.3291139240506329) internal successors, (525), 421 states have internal predecessors, (525), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:51:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 549 transitions. [2025-03-04 10:51:45,680 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 549 transitions. Word has length 62 [2025-03-04 10:51:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:45,680 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 549 transitions. [2025-03-04 10:51:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 23 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 549 transitions. [2025-03-04 10:51:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:51:45,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:45,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:45,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:45,881 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:45,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1844973943, now seen corresponding path program 1 times [2025-03-04 10:51:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131506876] [2025-03-04 10:51:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:51:45,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:51:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011532116] [2025-03-04 10:51:45,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:45,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:45,894 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:45,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:51:45,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:51:45,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:51:45,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:45,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:45,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:51:45,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:46,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131506876] [2025-03-04 10:51:46,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011532116] [2025-03-04 10:51:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011532116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:51:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165393162] [2025-03-04 10:51:46,489 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:46,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:46,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:51:46,490 INFO L87 Difference]: Start difference. First operand 436 states and 549 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:46,962 INFO L93 Difference]: Finished difference Result 488 states and 605 transitions. [2025-03-04 10:51:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:51:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-04 10:51:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:46,964 INFO L225 Difference]: With dead ends: 488 [2025-03-04 10:51:46,964 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 10:51:46,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:51:46,964 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 237 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:46,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 398 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:51:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 10:51:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 446. [2025-03-04 10:51:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 405 states have (on average 1.3234567901234568) internal successors, (536), 431 states have internal predecessors, (536), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:51:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 560 transitions. [2025-03-04 10:51:46,982 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 560 transitions. Word has length 63 [2025-03-04 10:51:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:46,983 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 560 transitions. [2025-03-04 10:51:46,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 560 transitions. [2025-03-04 10:51:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:51:46,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:46,983 INFO L218 NwaCegarLoop]: trace histogram [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, 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-04 10:51:46,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:51:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:51:47,184 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1359617319, now seen corresponding path program 1 times [2025-03-04 10:51:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780184068] [2025-03-04 10:51:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:47,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:51:47,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:51:47,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:47,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277530062] [2025-03-04 10:51:47,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:47,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:47,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:47,199 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:47,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:51:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:51:47,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:51:47,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:47,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:47,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:51:47,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:47,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780184068] [2025-03-04 10:51:47,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277530062] [2025-03-04 10:51:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277530062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:47,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:51:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868224510] [2025-03-04 10:51:47,763 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:47,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:51:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:47,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:51:47,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:51:47,764 INFO L87 Difference]: Start difference. First operand 446 states and 560 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:48,223 INFO L93 Difference]: Finished difference Result 493 states and 612 transitions. [2025-03-04 10:51:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:51:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 64 [2025-03-04 10:51:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:48,225 INFO L225 Difference]: With dead ends: 493 [2025-03-04 10:51:48,225 INFO L226 Difference]: Without dead ends: 489 [2025-03-04 10:51:48,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:51:48,225 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:48,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 336 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:51:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-04 10:51:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 459. [2025-03-04 10:51:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 418 states have (on average 1.30622009569378) internal successors, (546), 444 states have internal predecessors, (546), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:51:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 570 transitions. [2025-03-04 10:51:48,239 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 570 transitions. Word has length 64 [2025-03-04 10:51:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:48,239 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 570 transitions. [2025-03-04 10:51:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:51:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 570 transitions. [2025-03-04 10:51:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 10:51:48,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:48,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:48,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:51:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:51:48,440 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 748386784, now seen corresponding path program 1 times [2025-03-04 10:51:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984885088] [2025-03-04 10:51:48,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:48,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:51:48,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:51:48,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:48,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984885088] [2025-03-04 10:51:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984885088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051024885] [2025-03-04 10:51:48,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:48,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:48,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:48,491 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:48,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:51:48,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 10:51:48,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:51:48,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:48,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:48,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:48,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:48,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051024885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:48,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:51:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447804217] [2025-03-04 10:51:48,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:51:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:48,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:51:48,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:51:48,692 INFO L87 Difference]: Start difference. First operand 459 states and 570 transitions. Second operand has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:51:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:48,937 INFO L93 Difference]: Finished difference Result 492 states and 599 transitions. [2025-03-04 10:51:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:51:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2025-03-04 10:51:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:48,939 INFO L225 Difference]: With dead ends: 492 [2025-03-04 10:51:48,939 INFO L226 Difference]: Without dead ends: 490 [2025-03-04 10:51:48,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:51:48,939 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 275 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:48,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 225 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-04 10:51:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 462. [2025-03-04 10:51:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 421 states have (on average 1.2921615201900238) internal successors, (544), 447 states have internal predecessors, (544), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:51:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 568 transitions. [2025-03-04 10:51:48,955 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 568 transitions. Word has length 65 [2025-03-04 10:51:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 568 transitions. [2025-03-04 10:51:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.375) internal successors, (107), 9 states have internal predecessors, (107), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:51:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 568 transitions. [2025-03-04 10:51:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 10:51:48,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:48,956 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:48,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:49,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:51:49,156 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1725153878, now seen corresponding path program 1 times [2025-03-04 10:51:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680225577] [2025-03-04 10:51:49,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 10:51:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 10:51:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:51:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680225577] [2025-03-04 10:51:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680225577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:51:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768409347] [2025-03-04 10:51:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:51:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:51:49,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:51:49,191 INFO L87 Difference]: Start difference. First operand 462 states and 568 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:51:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,398 INFO L93 Difference]: Finished difference Result 707 states and 889 transitions. [2025-03-04 10:51:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2025-03-04 10:51:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,400 INFO L225 Difference]: With dead ends: 707 [2025-03-04 10:51:49,400 INFO L226 Difference]: Without dead ends: 705 [2025-03-04 10:51:49,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:51:49,401 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 272 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-04 10:51:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 630. [2025-03-04 10:51:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 584 states have (on average 1.2996575342465753) internal successors, (759), 610 states have internal predecessors, (759), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:51:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 793 transitions. [2025-03-04 10:51:49,425 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 793 transitions. Word has length 66 [2025-03-04 10:51:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:49,425 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 793 transitions. [2025-03-04 10:51:49,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:51:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 793 transitions. [2025-03-04 10:51:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:51:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:49,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:49,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 10:51:49,425 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1940162718, now seen corresponding path program 1 times [2025-03-04 10:51:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:49,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443588150] [2025-03-04 10:51:49,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:51:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:51:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443588150] [2025-03-04 10:51:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443588150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540851507] [2025-03-04 10:51:49,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:49,511 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:49,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:51:49,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 10:51:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:51:49,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:49,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:49,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:49,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:49,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540851507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-03-04 10:51:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560140978] [2025-03-04 10:51:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:51:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:51:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:49,725 INFO L87 Difference]: Start difference. First operand 630 states and 793 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:49,979 INFO L93 Difference]: Finished difference Result 647 states and 808 transitions. [2025-03-04 10:51:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:49,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2025-03-04 10:51:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:49,981 INFO L225 Difference]: With dead ends: 647 [2025-03-04 10:51:49,981 INFO L226 Difference]: Without dead ends: 645 [2025-03-04 10:51:49,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:49,981 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:49,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 304 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-04 10:51:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 638. [2025-03-04 10:51:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 592 states have (on average 1.2939189189189189) internal successors, (766), 618 states have internal predecessors, (766), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:51:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 800 transitions. [2025-03-04 10:51:50,015 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 800 transitions. Word has length 67 [2025-03-04 10:51:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:50,016 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 800 transitions. [2025-03-04 10:51:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 800 transitions. [2025-03-04 10:51:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:51:50,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:50,016 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:50,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:51:50,217 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1802017811, now seen corresponding path program 1 times [2025-03-04 10:51:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:50,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483398135] [2025-03-04 10:51:50,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:50,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:51:50,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:51:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494980976] [2025-03-04 10:51:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:50,228 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:50,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:51:50,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:51:50,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:51:50,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:50,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:50,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:51:50,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:50,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483398135] [2025-03-04 10:51:51,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:51,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494980976] [2025-03-04 10:51:51,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494980976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:51,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:51,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:51:51,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180590738] [2025-03-04 10:51:51,334 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:51,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2025-03-04 10:51:51,334 INFO L87 Difference]: Start difference. First operand 638 states and 800 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:52,029 INFO L93 Difference]: Finished difference Result 757 states and 951 transitions. [2025-03-04 10:51:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:51:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2025-03-04 10:51:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:52,031 INFO L225 Difference]: With dead ends: 757 [2025-03-04 10:51:52,031 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 10:51:52,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=498, Unknown=1, NotChecked=0, Total=650 [2025-03-04 10:51:52,031 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 181 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:52,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 415 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:51:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 10:51:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 703. [2025-03-04 10:51:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 655 states have (on average 1.297709923664122) internal successors, (850), 681 states have internal predecessors, (850), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 10:51:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 888 transitions. [2025-03-04 10:51:52,057 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 888 transitions. Word has length 70 [2025-03-04 10:51:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:52,058 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 888 transitions. [2025-03-04 10:51:52,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:51:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 888 transitions. [2025-03-04 10:51:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:51:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:52,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:52,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:52,259 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 27977345, now seen corresponding path program 1 times [2025-03-04 10:51:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:52,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450508760] [2025-03-04 10:51:52,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:51:52,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:51:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450508760] [2025-03-04 10:51:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450508760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800302806] [2025-03-04 10:51:52,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:52,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:52,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:52,350 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:52,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:51:52,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:51:52,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:51:52,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:52,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:52,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:52,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:52,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:51:52,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800302806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:52,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:52,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:51:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016215372] [2025-03-04 10:51:52,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:52,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:52,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:52,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:52,676 INFO L87 Difference]: Start difference. First operand 703 states and 888 transitions. Second operand has 13 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:51:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:53,025 INFO L93 Difference]: Finished difference Result 817 states and 1021 transitions. [2025-03-04 10:51:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:51:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-03-04 10:51:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:53,027 INFO L225 Difference]: With dead ends: 817 [2025-03-04 10:51:53,027 INFO L226 Difference]: Without dead ends: 815 [2025-03-04 10:51:53,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:51:53,028 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 117 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:53,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 456 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-04 10:51:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 718. [2025-03-04 10:51:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 670 states have (on average 1.2880597014925372) internal successors, (863), 696 states have internal predecessors, (863), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 10:51:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 901 transitions. [2025-03-04 10:51:53,068 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 901 transitions. Word has length 71 [2025-03-04 10:51:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:53,068 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 901 transitions. [2025-03-04 10:51:53,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:51:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 901 transitions. [2025-03-04 10:51:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:51:53,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:53,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-04 10:51:53,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 10:51:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:53,269 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash 833523366, now seen corresponding path program 1 times [2025-03-04 10:51:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417055342] [2025-03-04 10:51:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:53,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:51:53,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:51:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417055342] [2025-03-04 10:51:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417055342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967036756] [2025-03-04 10:51:53,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:53,324 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:53,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:51:53,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:51:53,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:51:53,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:53,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:53,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:53,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:53,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967036756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:53,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:53,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:51:53,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089776988] [2025-03-04 10:51:53,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:53,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:53,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:53,564 INFO L87 Difference]: Start difference. First operand 718 states and 901 transitions. Second operand has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:51:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:53,822 INFO L93 Difference]: Finished difference Result 1132 states and 1414 transitions. [2025-03-04 10:51:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:51:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 77 [2025-03-04 10:51:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:53,825 INFO L225 Difference]: With dead ends: 1132 [2025-03-04 10:51:53,825 INFO L226 Difference]: Without dead ends: 1130 [2025-03-04 10:51:53,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:51:53,826 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 699 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:53,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 283 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-04 10:51:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 968. [2025-03-04 10:51:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 913 states have (on average 1.276013143483023) internal successors, (1165), 938 states have internal predecessors, (1165), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:51:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1219 transitions. [2025-03-04 10:51:53,869 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1219 transitions. Word has length 77 [2025-03-04 10:51:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1219 transitions. [2025-03-04 10:51:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 14.5) internal successors, (174), 13 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:51:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1219 transitions. [2025-03-04 10:51:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:51:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:53,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:53,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:54,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-04 10:51:54,070 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:54,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash -645447216, now seen corresponding path program 1 times [2025-03-04 10:51:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:54,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123684194] [2025-03-04 10:51:54,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:51:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:51:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123684194] [2025-03-04 10:51:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123684194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542053373] [2025-03-04 10:51:54,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:54,109 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:54,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:51:54,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 10:51:54,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:51:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:54,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:51:54,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:54,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542053373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:54,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:51:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294008830] [2025-03-04 10:51:54,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:54,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:51:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:54,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:51:54,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:54,378 INFO L87 Difference]: Start difference. First operand 968 states and 1219 transitions. Second operand has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:54,735 INFO L93 Difference]: Finished difference Result 1492 states and 1859 transitions. [2025-03-04 10:51:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:51:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 80 [2025-03-04 10:51:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:54,738 INFO L225 Difference]: With dead ends: 1492 [2025-03-04 10:51:54,738 INFO L226 Difference]: Without dead ends: 1491 [2025-03-04 10:51:54,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:51:54,739 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 381 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:54,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 509 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-03-04 10:51:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1250. [2025-03-04 10:51:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1186 states have (on average 1.2774030354131534) internal successors, (1515), 1211 states have internal predecessors, (1515), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:51:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1587 transitions. [2025-03-04 10:51:54,791 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1587 transitions. Word has length 80 [2025-03-04 10:51:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:54,791 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1587 transitions. [2025-03-04 10:51:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1587 transitions. [2025-03-04 10:51:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:51:54,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:54,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-03-04 10:51:54,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:54,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:54,992 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:54,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2065328829, now seen corresponding path program 1 times [2025-03-04 10:51:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818925292] [2025-03-04 10:51:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:51:54,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:51:54,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:54,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818925292] [2025-03-04 10:51:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818925292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264235175] [2025-03-04 10:51:55,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:55,037 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:55,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:51:55,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:51:55,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:51:55,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:55,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:55,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264235175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:55,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:51:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759445024] [2025-03-04 10:51:55,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:55,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:51:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:55,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:51:55,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:55,191 INFO L87 Difference]: Start difference. First operand 1250 states and 1587 transitions. Second operand has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:55,302 INFO L93 Difference]: Finished difference Result 1574 states and 1974 transitions. [2025-03-04 10:51:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:51:55,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 81 [2025-03-04 10:51:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:55,305 INFO L225 Difference]: With dead ends: 1574 [2025-03-04 10:51:55,305 INFO L226 Difference]: Without dead ends: 1573 [2025-03-04 10:51:55,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:55,306 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:55,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 545 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-04 10:51:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1504. [2025-03-04 10:51:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1435 states have (on average 1.2557491289198606) internal successors, (1802), 1460 states have internal predecessors, (1802), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 10:51:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1884 transitions. [2025-03-04 10:51:55,358 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1884 transitions. Word has length 81 [2025-03-04 10:51:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:55,358 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1884 transitions. [2025-03-04 10:51:55,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1884 transitions. [2025-03-04 10:51:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:51:55,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:55,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:55,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:51:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:55,560 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 387641748, now seen corresponding path program 1 times [2025-03-04 10:51:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:55,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945865767] [2025-03-04 10:51:55,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:55,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:51:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:51:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322703420] [2025-03-04 10:51:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:55,573 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:55,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:51:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:51:55,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:51:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:55,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:51:55,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:55,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945865767] [2025-03-04 10:51:55,943 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322703420] [2025-03-04 10:51:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322703420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:55,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 10:51:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546864369] [2025-03-04 10:51:55,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:51:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:55,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:51:55,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:51:55,944 INFO L87 Difference]: Start difference. First operand 1504 states and 1884 transitions. Second operand has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:56,868 INFO L93 Difference]: Finished difference Result 1543 states and 1923 transitions. [2025-03-04 10:51:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:51:56,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 85 [2025-03-04 10:51:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:56,873 INFO L225 Difference]: With dead ends: 1543 [2025-03-04 10:51:56,873 INFO L226 Difference]: Without dead ends: 1541 [2025-03-04 10:51:56,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:51:56,874 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 182 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:56,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 527 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:51:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-04 10:51:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1512. [2025-03-04 10:51:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1443 states have (on average 1.2564102564102564) internal successors, (1813), 1468 states have internal predecessors, (1813), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 10:51:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1895 transitions. [2025-03-04 10:51:56,931 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1895 transitions. Word has length 85 [2025-03-04 10:51:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:56,931 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1895 transitions. [2025-03-04 10:51:56,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:51:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1895 transitions. [2025-03-04 10:51:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:51:56,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:56,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-04 10:51:56,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:57,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-04 10:51:57,132 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:57,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2078921131, now seen corresponding path program 1 times [2025-03-04 10:51:57,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:57,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261041578] [2025-03-04 10:51:57,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:57,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:51:57,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:51:57,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261041578] [2025-03-04 10:51:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261041578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154091232] [2025-03-04 10:51:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:57,176 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:57,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:51:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:51:57,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:51:57,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:57,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:57,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:51:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154091232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:57,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:57,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:51:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941116780] [2025-03-04 10:51:57,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:57,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:51:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:57,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:51:57,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:57,346 INFO L87 Difference]: Start difference. First operand 1512 states and 1895 transitions. Second operand has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:57,483 INFO L93 Difference]: Finished difference Result 2066 states and 2544 transitions. [2025-03-04 10:51:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:51:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 86 [2025-03-04 10:51:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:57,488 INFO L225 Difference]: With dead ends: 2066 [2025-03-04 10:51:57,488 INFO L226 Difference]: Without dead ends: 2065 [2025-03-04 10:51:57,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:57,489 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 324 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:57,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 585 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2025-03-04 10:51:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1807. [2025-03-04 10:51:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1729 states have (on average 1.2573742047426257) internal successors, (2174), 1754 states have internal predecessors, (2174), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 10:51:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2274 transitions. [2025-03-04 10:51:57,562 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2274 transitions. Word has length 86 [2025-03-04 10:51:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:57,562 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2274 transitions. [2025-03-04 10:51:57,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 14.636363636363637) internal successors, (161), 12 states have internal predecessors, (161), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:51:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2274 transitions. [2025-03-04 10:51:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:51:57,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:57,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 10:51:57,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:57,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 10:51:57,763 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:51:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash -177582275, now seen corresponding path program 1 times [2025-03-04 10:51:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:57,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828537913] [2025-03-04 10:51:57,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:57,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:51:57,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:51:57,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:57,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097243988] [2025-03-04 10:51:57,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:57,774 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:51:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:51:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:51:57,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:57,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:51:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:51:58,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:51:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828537913] [2025-03-04 10:51:58,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097243988] [2025-03-04 10:51:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097243988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:58,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 10:51:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392302548] [2025-03-04 10:51:58,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:51:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:58,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:51:58,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:51:58,897 INFO L87 Difference]: Start difference. First operand 1807 states and 2274 transitions. Second operand has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:01,689 INFO L93 Difference]: Finished difference Result 2672 states and 3362 transitions. [2025-03-04 10:52:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:52:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 87 [2025-03-04 10:52:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:01,694 INFO L225 Difference]: With dead ends: 2672 [2025-03-04 10:52:01,694 INFO L226 Difference]: Without dead ends: 2052 [2025-03-04 10:52:01,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=669, Invalid=2753, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:52:01,696 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 869 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:01,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 507 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 10:52:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-03-04 10:52:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1985. [2025-03-04 10:52:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1901 states have (on average 1.2593371909521305) internal successors, (2394), 1926 states have internal predecessors, (2394), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 10:52:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2506 transitions. [2025-03-04 10:52:01,783 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2506 transitions. Word has length 87 [2025-03-04 10:52:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:01,783 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2506 transitions. [2025-03-04 10:52:01,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.5) internal successors, (143), 23 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2506 transitions. [2025-03-04 10:52:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:52:01,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:01,784 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 10:52:01,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 10:52:01,988 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1469901831, now seen corresponding path program 1 times [2025-03-04 10:52:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583228730] [2025-03-04 10:52:01,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:01,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:52:02,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:52:02,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647674556] [2025-03-04 10:52:02,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:02,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:02,007 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:02,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-04 10:52:02,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:52:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:52:02,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:02,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:52:02,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:02,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583228730] [2025-03-04 10:52:02,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647674556] [2025-03-04 10:52:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647674556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:02,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:52:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989943301] [2025-03-04 10:52:02,685 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:52:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:02,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:52:02,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:52:02,685 INFO L87 Difference]: Start difference. First operand 1985 states and 2506 transitions. Second operand has 13 states, 12 states have (on average 6.416666666666667) internal successors, (77), 13 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:52:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:03,109 INFO L93 Difference]: Finished difference Result 1994 states and 2510 transitions. [2025-03-04 10:52:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:52:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.416666666666667) internal successors, (77), 13 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 91 [2025-03-04 10:52:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:03,113 INFO L225 Difference]: With dead ends: 1994 [2025-03-04 10:52:03,113 INFO L226 Difference]: Without dead ends: 1991 [2025-03-04 10:52:03,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:52:03,114 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 243 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:03,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 470 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-03-04 10:52:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1873. [2025-03-04 10:52:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1793 states have (on average 1.2459564974902397) internal successors, (2234), 1816 states have internal predecessors, (2234), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 10:52:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2342 transitions. [2025-03-04 10:52:03,185 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2342 transitions. Word has length 91 [2025-03-04 10:52:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:03,185 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2342 transitions. [2025-03-04 10:52:03,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.416666666666667) internal successors, (77), 13 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:52:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2342 transitions. [2025-03-04 10:52:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:52:03,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:03,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-04 10:52:03,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-04 10:52:03,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:03,386 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash 402342953, now seen corresponding path program 2 times [2025-03-04 10:52:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582069076] [2025-03-04 10:52:03,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:03,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:52:03,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:52:03,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:03,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23321265] [2025-03-04 10:52:03,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:03,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:03,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:03,401 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:03,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 10:52:03,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:52:03,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:52:03,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:03,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:03,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:52:03,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:03,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582069076] [2025-03-04 10:52:04,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23321265] [2025-03-04 10:52:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23321265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:04,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-03-04 10:52:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126082264] [2025-03-04 10:52:04,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:04,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:04,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:04,184 INFO L87 Difference]: Start difference. First operand 1873 states and 2342 transitions. Second operand has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:05,059 INFO L93 Difference]: Finished difference Result 1897 states and 2365 transitions. [2025-03-04 10:52:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:52:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 92 [2025-03-04 10:52:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:05,064 INFO L225 Difference]: With dead ends: 1897 [2025-03-04 10:52:05,064 INFO L226 Difference]: Without dead ends: 1895 [2025-03-04 10:52:05,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:52:05,065 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 576 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:05,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 390 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:52:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-04 10:52:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1862. [2025-03-04 10:52:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1782 states have (on average 1.2463524130190797) internal successors, (2221), 1805 states have internal predecessors, (2221), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 10:52:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2329 transitions. [2025-03-04 10:52:05,139 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2329 transitions. Word has length 92 [2025-03-04 10:52:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2329 transitions. [2025-03-04 10:52:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.818181818181818) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2329 transitions. [2025-03-04 10:52:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:52:05,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:05,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:05,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:05,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 10:52:05,345 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:05,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1260764504, now seen corresponding path program 1 times [2025-03-04 10:52:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300359984] [2025-03-04 10:52:05,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:05,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:05,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:05,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:05,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:05,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300359984] [2025-03-04 10:52:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300359984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890942669] [2025-03-04 10:52:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:05,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:05,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:05,465 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:05,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 10:52:05,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:05,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:05,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:52:05,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:05,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890942669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:05,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:05,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:52:05,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274496214] [2025-03-04 10:52:05,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:05,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:52:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:05,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:52:05,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:52:05,732 INFO L87 Difference]: Start difference. First operand 1862 states and 2329 transitions. Second operand has 15 states, 15 states have (on average 10.8) internal successors, (162), 15 states have internal predecessors, (162), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 10:52:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:05,963 INFO L93 Difference]: Finished difference Result 2375 states and 2942 transitions. [2025-03-04 10:52:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:52:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.8) internal successors, (162), 15 states have internal predecessors, (162), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 94 [2025-03-04 10:52:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:05,966 INFO L225 Difference]: With dead ends: 2375 [2025-03-04 10:52:05,966 INFO L226 Difference]: Without dead ends: 923 [2025-03-04 10:52:05,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:05,968 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 552 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:05,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 324 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-04 10:52:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 861. [2025-03-04 10:52:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 815 states have (on average 1.2) internal successors, (978), 833 states have internal predecessors, (978), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 10:52:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1028 transitions. [2025-03-04 10:52:06,016 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1028 transitions. Word has length 94 [2025-03-04 10:52:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:06,016 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1028 transitions. [2025-03-04 10:52:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.8) internal successors, (162), 15 states have internal predecessors, (162), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 10:52:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1028 transitions. [2025-03-04 10:52:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 10:52:06,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:06,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-04 10:52:06,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-03-04 10:52:06,221 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1773512995, now seen corresponding path program 1 times [2025-03-04 10:52:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251024852] [2025-03-04 10:52:06,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:06,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:06,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:06,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:06,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251024852] [2025-03-04 10:52:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251024852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64970648] [2025-03-04 10:52:06,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:06,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:06,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:06,343 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 10:52:06,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 10:52:06,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 10:52:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:06,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:52:06,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:06,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64970648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:06,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 10:52:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752857773] [2025-03-04 10:52:06,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:52:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:06,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:52:06,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:52:06,853 INFO L87 Difference]: Start difference. First operand 861 states and 1028 transitions. Second operand has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:07,651 INFO L93 Difference]: Finished difference Result 906 states and 1074 transitions. [2025-03-04 10:52:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:52:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 94 [2025-03-04 10:52:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:07,657 INFO L225 Difference]: With dead ends: 906 [2025-03-04 10:52:07,657 INFO L226 Difference]: Without dead ends: 905 [2025-03-04 10:52:07,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:52:07,658 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 152 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:07,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 835 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-04 10:52:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 882. [2025-03-04 10:52:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 836 states have (on average 1.194976076555024) internal successors, (999), 854 states have internal predecessors, (999), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 10:52:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1049 transitions. [2025-03-04 10:52:07,696 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1049 transitions. Word has length 94 [2025-03-04 10:52:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1049 transitions. [2025-03-04 10:52:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.818181818181818) internal successors, (216), 23 states have internal predecessors, (216), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 10:52:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1049 transitions. [2025-03-04 10:52:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:07,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:07,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-04 10:52:07,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-03-04 10:52:07,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:07,902 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:07,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -855672029, now seen corresponding path program 1 times [2025-03-04 10:52:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397574682] [2025-03-04 10:52:07,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:07,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:07,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:07,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:07,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:52:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397574682] [2025-03-04 10:52:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397574682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:52:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698184927] [2025-03-04 10:52:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:07,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:07,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:07,943 INFO L87 Difference]: Start difference. First operand 882 states and 1049 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:08,030 INFO L93 Difference]: Finished difference Result 884 states and 1050 transitions. [2025-03-04 10:52:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:52:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2025-03-04 10:52:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:08,033 INFO L225 Difference]: With dead ends: 884 [2025-03-04 10:52:08,033 INFO L226 Difference]: Without dead ends: 806 [2025-03-04 10:52:08,033 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-04 10:52:08,034 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:08,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 181 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-04 10:52:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-03-04 10:52:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 762 states have (on average 1.211286089238845) internal successors, (923), 780 states have internal predecessors, (923), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:52:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 969 transitions. [2025-03-04 10:52:08,067 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 969 transitions. Word has length 95 [2025-03-04 10:52:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:08,068 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 969 transitions. [2025-03-04 10:52:08,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:52:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 969 transitions. [2025-03-04 10:52:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:08,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:08,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 10:52:08,069 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:08,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1409497060, now seen corresponding path program 1 times [2025-03-04 10:52:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:08,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033901522] [2025-03-04 10:52:08,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:08,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:08,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:08,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033901522] [2025-03-04 10:52:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033901522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148404956] [2025-03-04 10:52:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:08,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:08,202 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:08,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 10:52:08,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:08,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:08,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:08,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:52:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:08,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148404956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:08,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-04 10:52:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195322930] [2025-03-04 10:52:08,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:08,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:52:08,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:08,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:52:08,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:52:08,594 INFO L87 Difference]: Start difference. First operand 806 states and 969 transitions. Second operand has 16 states, 16 states have (on average 10.8125) internal successors, (173), 16 states have internal predecessors, (173), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 10:52:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:08,738 INFO L93 Difference]: Finished difference Result 830 states and 981 transitions. [2025-03-04 10:52:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:52:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.8125) internal successors, (173), 16 states have internal predecessors, (173), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 95 [2025-03-04 10:52:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:08,739 INFO L225 Difference]: With dead ends: 830 [2025-03-04 10:52:08,739 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 10:52:08,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:52:08,739 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:08,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 312 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 10:52:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-04 10:52:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 215 states have (on average 1.1116279069767443) internal successors, (239), 227 states have internal predecessors, (239), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:52:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 253 transitions. [2025-03-04 10:52:08,748 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 253 transitions. Word has length 95 [2025-03-04 10:52:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 253 transitions. [2025-03-04 10:52:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.8125) internal successors, (173), 16 states have internal predecessors, (173), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 10:52:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 253 transitions. [2025-03-04 10:52:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:52:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:08,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 10:52:08,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:08,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-03-04 10:52:08,949 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:08,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash 667946243, now seen corresponding path program 1 times [2025-03-04 10:52:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529119943] [2025-03-04 10:52:08,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:08,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:08,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548786906] [2025-03-04 10:52:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:08,962 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-04 10:52:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:52:08,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:52:08,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:08,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:52:08,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:09,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529119943] [2025-03-04 10:52:09,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548786906] [2025-03-04 10:52:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548786906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:09,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 10:52:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840599074] [2025-03-04 10:52:09,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:52:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:52:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:52:09,561 INFO L87 Difference]: Start difference. First operand 237 states and 253 transitions. Second operand has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:10,328 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2025-03-04 10:52:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:52:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 95 [2025-03-04 10:52:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:10,329 INFO L225 Difference]: With dead ends: 303 [2025-03-04 10:52:10,329 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 10:52:10,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:52:10,330 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 548 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:10,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 456 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:52:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 10:52:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 266. [2025-03-04 10:52:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.1069958847736625) internal successors, (269), 255 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 285 transitions. [2025-03-04 10:52:10,340 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 285 transitions. Word has length 95 [2025-03-04 10:52:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:10,341 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 285 transitions. [2025-03-04 10:52:10,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.777777777777779) internal successors, (158), 19 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 10:52:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 285 transitions. [2025-03-04 10:52:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:52:10,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:10,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:52:10,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:10,542 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1057573536, now seen corresponding path program 1 times [2025-03-04 10:52:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352041056] [2025-03-04 10:52:10,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:52:10,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:52:10,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:10,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:10,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352041056] [2025-03-04 10:52:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352041056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982966395] [2025-03-04 10:52:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:10,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:10,597 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:10,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-04 10:52:10,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:52:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:52:10,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:10,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:10,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:10,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:52:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982966395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:10,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:10,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-04 10:52:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310393419] [2025-03-04 10:52:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:10,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:52:10,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:10,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:52:10,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:52:10,713 INFO L87 Difference]: Start difference. First operand 266 states and 285 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:10,812 INFO L93 Difference]: Finished difference Result 266 states and 285 transitions. [2025-03-04 10:52:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:52:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 98 [2025-03-04 10:52:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:10,813 INFO L225 Difference]: With dead ends: 266 [2025-03-04 10:52:10,813 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 10:52:10,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:52:10,813 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:10,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 242 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 10:52:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-04 10:52:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 243 states have (on average 1.102880658436214) internal successors, (268), 254 states have internal predecessors, (268), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 284 transitions. [2025-03-04 10:52:10,823 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 284 transitions. Word has length 98 [2025-03-04 10:52:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 284 transitions. [2025-03-04 10:52:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 284 transitions. [2025-03-04 10:52:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:52:10,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:10,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 10:52:10,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:11,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:11,028 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2001636863, now seen corresponding path program 2 times [2025-03-04 10:52:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504259354] [2025-03-04 10:52:11,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:11,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:52:11,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:11,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:11,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759958467] [2025-03-04 10:52:11,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:11,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:11,048 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:11,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-04 10:52:11,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:52:11,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:11,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:11,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:11,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:52:11,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:11,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504259354] [2025-03-04 10:52:11,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759958467] [2025-03-04 10:52:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759958467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:11,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:52:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 10:52:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875690142] [2025-03-04 10:52:11,412 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:52:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:11,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:52:11,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:52:11,413 INFO L87 Difference]: Start difference. First operand 265 states and 284 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:11,832 INFO L93 Difference]: Finished difference Result 267 states and 286 transitions. [2025-03-04 10:52:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:52:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 99 [2025-03-04 10:52:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:11,834 INFO L225 Difference]: With dead ends: 267 [2025-03-04 10:52:11,834 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 10:52:11,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:52:11,834 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 198 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:11,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 541 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 10:52:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-03-04 10:52:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 243 states have (on average 1.0823045267489713) internal successors, (263), 252 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 279 transitions. [2025-03-04 10:52:11,846 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 279 transitions. Word has length 99 [2025-03-04 10:52:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 279 transitions. [2025-03-04 10:52:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:52:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 279 transitions. [2025-03-04 10:52:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:52:11,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:11,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:52:11,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-03-04 10:52:12,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-04 10:52:12,047 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:12,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1574958726, now seen corresponding path program 1 times [2025-03-04 10:52:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172091126] [2025-03-04 10:52:12,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:52:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:12,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479233248] [2025-03-04 10:52:12,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:12,067 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:12,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-04 10:52:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 10:52:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:52:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:12,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:52:12,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:12,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:52:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172091126] [2025-03-04 10:52:13,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479233248] [2025-03-04 10:52:13,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479233248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:13,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:52:13,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-03-04 10:52:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587472997] [2025-03-04 10:52:13,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:52:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:13,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:52:13,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:52:13,473 INFO L87 Difference]: Start difference. First operand 263 states and 279 transitions. Second operand has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:14,770 INFO L93 Difference]: Finished difference Result 280 states and 297 transitions. [2025-03-04 10:52:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:52:14,770 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 99 [2025-03-04 10:52:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:14,771 INFO L225 Difference]: With dead ends: 280 [2025-03-04 10:52:14,771 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 10:52:14,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=810, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:52:14,772 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 126 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:14,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 259 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:52:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 10:52:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-04 10:52:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 235 states have (on average 1.0851063829787233) internal successors, (255), 244 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 271 transitions. [2025-03-04 10:52:14,782 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 271 transitions. Word has length 99 [2025-03-04 10:52:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:14,782 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 271 transitions. [2025-03-04 10:52:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 10:52:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 271 transitions. [2025-03-04 10:52:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 10:52:14,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:14,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-04 10:52:14,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-03-04 10:52:14,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-04 10:52:14,984 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash 956867449, now seen corresponding path program 1 times [2025-03-04 10:52:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15057104] [2025-03-04 10:52:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:14,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:52:14,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:52:14,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:14,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15057104] [2025-03-04 10:52:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15057104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521288557] [2025-03-04 10:52:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:15,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:15,100 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-04 10:52:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:52:15,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:52:15,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:15,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:52:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:15,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:52:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521288557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:15,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:52:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490119728] [2025-03-04 10:52:15,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:15,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:52:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:15,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:52:15,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:52:15,508 INFO L87 Difference]: Start difference. First operand 255 states and 271 transitions. Second operand has 19 states, 18 states have (on average 11.666666666666666) internal successors, (210), 19 states have internal predecessors, (210), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 10:52:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:15,861 INFO L93 Difference]: Finished difference Result 255 states and 271 transitions. [2025-03-04 10:52:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:52:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 11.666666666666666) internal successors, (210), 19 states have internal predecessors, (210), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 105 [2025-03-04 10:52:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:15,862 INFO L225 Difference]: With dead ends: 255 [2025-03-04 10:52:15,862 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 10:52:15,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:52:15,862 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 129 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:15,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 553 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 10:52:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-04 10:52:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.0595744680851065) internal successors, (249), 242 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:52:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2025-03-04 10:52:15,873 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 105 [2025-03-04 10:52:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2025-03-04 10:52:15,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 11.666666666666666) internal successors, (210), 19 states have internal predecessors, (210), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 10:52:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2025-03-04 10:52:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 10:52:15,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:15,873 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:15,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:16,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-04 10:52:16,074 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1899486345, now seen corresponding path program 2 times [2025-03-04 10:52:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:16,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123129448] [2025-03-04 10:52:16,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:16,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 10:52:16,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:52:16,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:16,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:52:16,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:16,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123129448] [2025-03-04 10:52:16,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123129448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:16,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856242538] [2025-03-04 10:52:16,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:52:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:16,201 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:16,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-04 10:52:16,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-04 10:52:16,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:52:16,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:52:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:16,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:52:16,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 49 proven. 74 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:52:16,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 49 proven. 74 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:52:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856242538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:16,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:16,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 29 [2025-03-04 10:52:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242735018] [2025-03-04 10:52:16,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:52:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:16,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:52:16,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:52:16,904 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 29 states, 29 states have (on average 10.068965517241379) internal successors, (292), 29 states have internal predecessors, (292), 11 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 10:52:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:17,334 INFO L93 Difference]: Finished difference Result 258 states and 268 transitions. [2025-03-04 10:52:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:52:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.068965517241379) internal successors, (292), 29 states have internal predecessors, (292), 11 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Word has length 133 [2025-03-04 10:52:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:17,336 INFO L225 Difference]: With dead ends: 258 [2025-03-04 10:52:17,336 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:52:17,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:52:17,337 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 151 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:17,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 605 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:52:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 10:52:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 114 states have (on average 1.0) internal successors, (114), 114 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:52:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2025-03-04 10:52:17,352 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 133 [2025-03-04 10:52:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:17,352 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2025-03-04 10:52:17,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.068965517241379) internal successors, (292), 29 states have internal predecessors, (292), 11 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 10:52:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2025-03-04 10:52:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 10:52:17,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:17,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:17,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:17,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:17,553 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 10:52:17,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1108869762, now seen corresponding path program 1 times [2025-03-04 10:52:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378997206] [2025-03-04 10:52:17,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:17,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 10:52:17,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:52:17,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:17,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:52:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378997206] [2025-03-04 10:52:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378997206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:52:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377995364] [2025-03-04 10:52:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:17,613 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-03-04 10:52:17,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 10:52:17,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:52:17,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:17,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:17,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:52:17,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:52:17,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:52:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:52:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377995364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:52:17,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:52:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:52:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673587015] [2025-03-04 10:52:17,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:52:17,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:52:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:17,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:52:17,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:52:17,848 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 14 states, 13 states have (on average 18.846153846153847) internal successors, (245), 14 states have internal predecessors, (245), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 10:52:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:17,883 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2025-03-04 10:52:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:52:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 18.846153846153847) internal successors, (245), 14 states have internal predecessors, (245), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 133 [2025-03-04 10:52:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:17,883 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:52:17,883 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:52:17,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:52:17,884 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:17,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 326 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:52:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:52:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:52:17,884 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-04 10:52:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:52:17,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2025-03-04 10:52:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:17,884 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:52:17,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 18.846153846153847) internal successors, (245), 14 states have internal predecessors, (245), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 10:52:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:52:17,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:52:17,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 58 remaining) [2025-03-04 10:52:17,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 58 remaining) [2025-03-04 10:52:17,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 58 remaining) [2025-03-04 10:52:17,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 58 remaining) [2025-03-04 10:52:17,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 58 remaining) [2025-03-04 10:52:17,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:18,094 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:18,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:52:19,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:52:19,251 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:52:19,252 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 10:52:19,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:52:19 BoogieIcfgContainer [2025-03-04 10:52:19,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:52:19,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:52:19,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:52:19,255 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:52:19,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:51:26" (3/4) ... [2025-03-04 10:52:19,258 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:52:19,262 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 10:52:19,262 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:52:19,269 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 10:52:19,270 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:52:19,270 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:52:19,270 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:52:19,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:52:19,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:52:19,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:52:19,336 INFO L158 Benchmark]: Toolchain (without parser) took 53733.10ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.5MB in the beginning and 164.2MB in the end (delta: -50.7MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.23ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.43ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: IcfgBuilder took 388.77ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 77.7MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: TraceAbstraction took 53016.97ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.2MB in the beginning and 171.6MB in the end (delta: -94.4MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2025-03-04 10:52:19,336 INFO L158 Benchmark]: Witness Printer took 80.49ms. Allocated memory is still 327.2MB. Free memory was 171.6MB in the beginning and 164.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:52:19,337 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.23ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.43ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 388.77ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 77.7MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53016.97ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 77.2MB in the beginning and 171.6MB in the end (delta: -94.4MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. * Witness Printer took 80.49ms. Allocated memory is still 327.2MB. Free memory was 171.6MB in the beginning and 164.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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 - 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 - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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 3 procedures, 140 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 61, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13834 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13803 mSDsluCounter, 19096 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14640 mSDsCounter, 533 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29670 IncrementalHoareTripleChecker+Invalid, 30203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 533 mSolverCounterUnsat, 4456 mSDtfsCounter, 29670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5601 GetRequests, 4766 SyntacticMatches, 15 SemanticMatches, 820 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3688 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1985occurred in iteration=48, InterpolantAutomatonStates: 669, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 2453 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 6646 NumberOfCodeBlocks, 6646 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 6919 ConstructedInterpolants, 33 QuantifiedInterpolants, 47716 SizeOfPredicates, 100 NumberOfNonLiveVariables, 5664 ConjunctsInSsa, 477 ConjunctsInUnsatCore, 103 InterpolantComputations, 30 PerfectInterpolantSequences, 1065/2864 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 58 specifications checked. All of them hold - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (((((((((((Y <= 1) && (0 <= Y)) && (y == 0)) && (((long long) 2 * Y) == ((__int128) X + v))) && (0 <= X)) && (x == 0)) && (((long long) 2 * Y) <= ((__int128) v + 1))) || (((((((((2 == x) && (xy == 0)) && (((__int128) 3 + v) <= ((long long) 2 * X))) && (0 <= yx)) && (y == 0)) && (Y == 0)) && (0 <= ((__int128) X + v))) && (X == 1)) && (yx <= 4611686018427387903))) || ((((((((2 == x) && (xy <= 4611686018427387903)) && (v <= 1)) && (2 == y)) && (Y == 1)) && (0 <= v)) && (X == 1)) && (yx <= 4611686018427387903))) || ((((((((((Y <= 1) && (xy == 0)) && (((long long) Y * 4) == ((__int128) v + ((long long) 3 * X)))) && (0 <= yx)) && (x == 1)) && (y == 1)) && (yx <= 1)) && (0 <= X)) && (X <= Y)) && (((yx >= 0) ? (yx % 2) : ((yx % 2) + 2)) == 0))) || ((((((((xy == 0) && (((__int128) v + 1) == 0)) && (0 <= yx)) && (x == 1)) && (y == 0)) && (Y == 0)) && (0 <= ((((__int128) -1 * yx) >= 0) ? (((__int128) -1 * yx) / 2) : ((((__int128) -1 * yx) / 2) - 1)))) && (X == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:52:19,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE