./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.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/lcm1_unwindbound10.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 357c28cbcf8a6aaf949faeabbb5ae0b19b92db6bb2faeba12cd91e7c958ae977 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:13:42,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:13:42,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:13:42,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:13:42,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:13:42,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:13:42,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:13:42,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:13:42,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:13:42,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:13:42,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:13:42,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:13:42,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:13:42,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:42,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:13:42,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:13:42,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:13:42,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:13:42,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:13:42,984 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 -> 357c28cbcf8a6aaf949faeabbb5ae0b19b92db6bb2faeba12cd91e7c958ae977 [2025-03-04 11:13:43,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:13:43,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:13:43,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:13:43,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:13:43,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:13:43,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.c [2025-03-04 11:13:44,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d3f6046/c2e83a9218554a20bcd700d2a4779165/FLAGe616695d3 [2025-03-04 11:13:44,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:13:44,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.c [2025-03-04 11:13:44,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d3f6046/c2e83a9218554a20bcd700d2a4779165/FLAGe616695d3 [2025-03-04 11:13:45,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d3f6046/c2e83a9218554a20bcd700d2a4779165 [2025-03-04 11:13:45,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:13:45,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:13:45,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:45,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:13:45,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:13:45,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed7a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45, skipping insertion in model container [2025-03-04 11:13:45,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:13:45,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:45,197 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:13:45,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:45,229 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:13:45,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45 WrapperNode [2025-03-04 11:13:45,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:45,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:45,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:13:45,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:13:45,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,257 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-04 11:13:45,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:45,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:13:45,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:13:45,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:13:45,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,280 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-04 11:13:45,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:13:45,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:13:45,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:13:45,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:13:45,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (1/1) ... [2025-03-04 11:13:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:45,318 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 11:13:45,323 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 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:13:45,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:13:45,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:13:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:13:45,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:13:45,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:13:45,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:13:45,586 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 11:13:45,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:13:45,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:13:45,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:13:45,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:45 BoogieIcfgContainer [2025-03-04 11:13:45,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:13:45,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:13:45,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:13:45,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:13:45,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:13:45" (1/3) ... [2025-03-04 11:13:45,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:45, skipping insertion in model container [2025-03-04 11:13:45,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:45" (2/3) ... [2025-03-04 11:13:45,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:45, skipping insertion in model container [2025-03-04 11:13:45,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:45" (3/3) ... [2025-03-04 11:13:45,610 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound10.c [2025-03-04 11:13:45,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:13:45,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound10.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 11:13:45,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:13:45,682 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;@4654770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:13:45,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:13:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:45,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:45,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:45,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-04 11:13:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982691591] [2025-03-04 11:13:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:45,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:45,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982691591] [2025-03-04 11:13:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982691591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227894501] [2025-03-04 11:13:45,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:45,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:45,829 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 11:13:45,831 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 11:13:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:45,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:45,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:45,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:13:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:45,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227894501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:13:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233408828] [2025-03-04 11:13:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:13:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:45,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:13:45,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:45,920 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:45,933 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-04 11:13:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:13:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 11:13:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:45,939 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:13:45,939 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 11:13:45,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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 11:13:45,944 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:45,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 11:13:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 11:13:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 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 11:13:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-04 11:13:45,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-04 11:13:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-04 11:13:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-04 11:13:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:45,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:45,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:45,984 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 11:13:46,179 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 11:13:46,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-04 11:13:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559402167] [2025-03-04 11:13:46,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:46,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:46,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:46,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:46,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559402167] [2025-03-04 11:13:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559402167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:13:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130291404] [2025-03-04 11:13:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:46,336 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:46,386 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 11:13:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:13:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-03-04 11:13:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:46,388 INFO L225 Difference]: With dead ends: 45 [2025-03-04 11:13:46,389 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 11:13:46,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 11:13:46,390 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:46,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 11:13:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-04 11:13:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 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 11:13:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-04 11:13:46,399 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-04 11:13:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:46,400 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-04 11:13:46,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-04 11:13:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:13:46,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:46,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 11:13:46,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:13:46,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-04 11:13:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359656065] [2025-03-04 11:13:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:13:46,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:13:46,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:46,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359656065] [2025-03-04 11:13:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359656065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569730251] [2025-03-04 11:13:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:46,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:46,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:46,583 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:46,739 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-04 11:13:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:13:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-04 11:13:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:46,741 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:13:46,741 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:13:46,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:46,743 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:46,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:13:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-04 11:13:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-04 11:13:46,752 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-04 11:13:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:46,753 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-04 11:13:46,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-04 11:13:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:13:46,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:46,753 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 11:13:46,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:13:46,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:46,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-04 11:13:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151936186] [2025-03-04 11:13:46,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:46,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:13:46,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:13:46,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:46,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151936186] [2025-03-04 11:13:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151936186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219328629] [2025-03-04 11:13:46,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:46,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:46,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:46,893 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:46,973 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-04 11:13:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:13:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-04 11:13:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:46,974 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:13:46,974 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:13:46,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:46,975 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:46,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:13:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 11:13:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 11:13:46,982 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-04 11:13:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 11:13:46,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 11:13:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:13:46,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:46,983 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 11:13:46,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:13:46,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:46,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-04 11:13:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-03-04 11:13:46,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:46,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:13:47,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:13:47,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:47,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:47,140 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 11:13:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-03-04 11:13:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651903947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84491985] [2025-03-04 11:13:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:47,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:47,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:47,141 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:47,469 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-04 11:13:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:13:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-04 11:13:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:47,472 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:13:47,474 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:13:47,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:47,475 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:47,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:13:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-04 11:13:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:13:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-04 11:13:47,483 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-04 11:13:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-04 11:13:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-04 11:13:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:47,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:47,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 11:13:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:13:47,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:47,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-04 11:13:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607867523] [2025-03-04 11:13:47,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:47,603 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 11:13:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607867523] [2025-03-04 11:13:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607867523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131087580] [2025-03-04 11:13:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:47,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:47,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:47,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:47,604 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:47,770 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-04 11:13:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:13:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-04 11:13:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:47,772 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:13:47,772 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:13:47,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:47,773 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 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 11:13:47,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:13:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-04 11:13:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:13:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-04 11:13:47,778 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-04 11:13:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 11:13:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-04 11:13:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:47,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:47,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:13:47,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-04 11:13:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352838809] [2025-03-04 11:13:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:47,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:47,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:47,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:47,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352838809] [2025-03-04 11:13:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352838809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955169688] [2025-03-04 11:13:47,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:47,896 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 11:13:47,898 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 11:13:47,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:47,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:47,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:47,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:13:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:48,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955169688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:48,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 11:13:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762321486] [2025-03-04 11:13:48,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:13:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:48,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:13:48,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:13:48,155 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:48,714 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-04 11:13:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:13:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 46 [2025-03-04 11:13:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:48,716 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:13:48,716 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:13:48,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:13:48,717 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:48,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:13:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:13:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-04 11:13:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:13:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-04 11:13:48,739 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-04 11:13:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:48,739 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-04 11:13:48,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-04 11:13:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:13:48,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:48,743 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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 11:13:48,752 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 11:13:48,944 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,SelfDestructingSolverStorable6 [2025-03-04 11:13:48,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-04 11:13:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963885318] [2025-03-04 11:13:48,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:48,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:13:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:13:48,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:48,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963885318] [2025-03-04 11:13:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963885318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:13:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382735683] [2025-03-04 11:13:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:49,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:49,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:49,032 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:49,074 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-04 11:13:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:13:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2025-03-04 11:13:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:49,076 INFO L225 Difference]: With dead ends: 270 [2025-03-04 11:13:49,077 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:13:49,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 11:13:49,079 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:49,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:13:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-04 11:13:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:13:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-04 11:13:49,104 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-04 11:13:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:49,104 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-04 11:13:49,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-04 11:13:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:13:49,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:49,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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 11:13:49,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:13:49,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-04 11:13:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424365756] [2025-03-04 11:13:49,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:49,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424365756] [2025-03-04 11:13:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424365756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573043825] [2025-03-04 11:13:49,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:49,274 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 11:13:49,276 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 11:13:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:13:49,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:49,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573043825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:49,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-04 11:13:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91562091] [2025-03-04 11:13:49,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:49,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:13:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:49,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:13:49,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:13:49,590 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:50,525 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-04 11:13:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 11:13:50,526 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 56 [2025-03-04 11:13:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:50,527 INFO L225 Difference]: With dead ends: 379 [2025-03-04 11:13:50,527 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:13:50,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:13:50,529 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:13:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:13:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-04 11:13:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:13:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-04 11:13:50,550 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-04 11:13:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:50,550 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-04 11:13:50,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-04 11:13:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:13:50,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:50,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-03-04 11:13:50,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:13:50,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:50,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:50,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-04 11:13:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108964304] [2025-03-04 11:13:50,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:50,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:50,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108964304] [2025-03-04 11:13:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108964304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209704988] [2025-03-04 11:13:50,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:50,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:50,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:50,881 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 11:13:50,883 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 11:13:50,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:50,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:13:50,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:51,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209704988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:51,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-04 11:13:51,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069936060] [2025-03-04 11:13:51,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:51,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:13:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:51,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:13:51,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:13:51,146 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:13:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:51,694 INFO L93 Difference]: Finished difference Result 471 states and 581 transitions. [2025-03-04 11:13:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:13:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 59 [2025-03-04 11:13:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:51,698 INFO L225 Difference]: With dead ends: 471 [2025-03-04 11:13:51,699 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 11:13:51,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:13:51,701 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:51,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:13:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 11:13:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2025-03-04 11:13:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.244186046511628) internal successors, (321), 263 states have internal predecessors, (321), 33 states have call successors, (33), 26 states have call predecessors, (33), 26 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:13:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2025-03-04 11:13:51,715 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 59 [2025-03-04 11:13:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:51,715 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2025-03-04 11:13:51,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:13:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2025-03-04 11:13:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:13:51,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:51,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 11:13:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:13:51,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:51,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:51,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-04 11:13:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:51,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421961733] [2025-03-04 11:13:51,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:51,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:51,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:51,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:51,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421961733] [2025-03-04 11:13:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421961733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004328785] [2025-03-04 11:13:52,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:52,086 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 11:13:52,106 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 11:13:52,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:52,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:52,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:13:52,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:52,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004328785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:52,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:52,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-04 11:13:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780883508] [2025-03-04 11:13:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:52,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:13:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:52,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:13:52,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:13:52,276 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:13:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:52,575 INFO L93 Difference]: Finished difference Result 391 states and 469 transitions. [2025-03-04 11:13:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:13:52,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 65 [2025-03-04 11:13:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:52,577 INFO L225 Difference]: With dead ends: 391 [2025-03-04 11:13:52,577 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 11:13:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:13:52,578 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:52,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 141 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:13:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 11:13:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 293. [2025-03-04 11:13:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.1623931623931625) internal successors, (272), 237 states have internal predecessors, (272), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 11:13:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 334 transitions. [2025-03-04 11:13:52,595 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 334 transitions. Word has length 65 [2025-03-04 11:13:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:52,596 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 334 transitions. [2025-03-04 11:13:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:13:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2025-03-04 11:13:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:13:52,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:52,597 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 11:13:52,603 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 11:13:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:13:52,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-04 11:13:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101010580] [2025-03-04 11:13:52,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:13:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:13:52,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101010580] [2025-03-04 11:13:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101010580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123669493] [2025-03-04 11:13:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:52,953 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 11:13:52,954 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 11:13:52,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:13:52,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:13:52,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:13:52,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:53,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123669493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:53,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-04 11:13:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677419311] [2025-03-04 11:13:53,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:53,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:13:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:53,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:13:53,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:13:53,303 INFO L87 Difference]: Start difference. First operand 293 states and 334 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:13:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,251 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2025-03-04 11:13:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:13:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 66 [2025-03-04 11:13:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,254 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:13:54,254 INFO L226 Difference]: Without dead ends: 331 [2025-03-04 11:13:54,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 11:13:54,256 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 351 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:13:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-04 11:13:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2025-03-04 11:13:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 248 states have internal predecessors, (284), 32 states have call successors, (32), 26 states have call predecessors, (32), 26 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:13:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 348 transitions. [2025-03-04 11:13:54,269 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 348 transitions. Word has length 66 [2025-03-04 11:13:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,270 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 348 transitions. [2025-03-04 11:13:54,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:13:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 348 transitions. [2025-03-04 11:13:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:13:54,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,271 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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 11:13:54,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:13:54,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:54,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -417891471, now seen corresponding path program 1 times [2025-03-04 11:13:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135210695] [2025-03-04 11:13:54,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:13:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:13:54,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:13:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135210695] [2025-03-04 11:13:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135210695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641785922] [2025-03-04 11:13:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:54,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:54,678 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 11:13:54,680 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 11:13:54,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:13:54,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:13:54,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:13:54,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:54,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:13:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641785922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:54,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2025-03-04 11:13:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279001752] [2025-03-04 11:13:54,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:13:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:13:54,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:13:54,993 INFO L87 Difference]: Start difference. First operand 306 states and 348 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 11:13:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,518 INFO L93 Difference]: Finished difference Result 528 states and 611 transitions. [2025-03-04 11:13:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 11:13:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) Word has length 80 [2025-03-04 11:13:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,521 INFO L225 Difference]: With dead ends: 528 [2025-03-04 11:13:55,521 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 11:13:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=1380, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:13:55,522 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 131 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 310 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 11:13:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 350. [2025-03-04 11:13:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 281 states have (on average 1.1530249110320285) internal successors, (324), 284 states have internal predecessors, (324), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:13:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 396 transitions. [2025-03-04 11:13:55,545 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 396 transitions. Word has length 80 [2025-03-04 11:13:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,546 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 396 transitions. [2025-03-04 11:13:55,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 11:13:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 396 transitions. [2025-03-04 11:13:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:13:55,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,547 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 11:13:55,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:13:55,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:55,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -312192998, now seen corresponding path program 1 times [2025-03-04 11:13:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592055648] [2025-03-04 11:13:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:13:55,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:13:55,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:13:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592055648] [2025-03-04 11:13:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592055648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162057249] [2025-03-04 11:13:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:55,986 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 11:13:55,987 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 11:13:56,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:13:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:13:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:13:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:56,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:13:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162057249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:56,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:56,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:13:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979621916] [2025-03-04 11:13:56,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:13:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:13:56,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:13:56,579 INFO L87 Difference]: Start difference. First operand 350 states and 396 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:13:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:58,271 INFO L93 Difference]: Finished difference Result 766 states and 895 transitions. [2025-03-04 11:13:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 11:13:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-04 11:13:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:58,274 INFO L225 Difference]: With dead ends: 766 [2025-03-04 11:13:58,275 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 11:13:58,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:13:58,279 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 399 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:58,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 424 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:13:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 11:13:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 546. [2025-03-04 11:13:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 437 states have (on average 1.1762013729977117) internal successors, (514), 440 states have internal predecessors, (514), 56 states have call successors, (56), 50 states have call predecessors, (56), 50 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 11:13:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 626 transitions. [2025-03-04 11:13:58,312 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 626 transitions. Word has length 86 [2025-03-04 11:13:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 626 transitions. [2025-03-04 11:13:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:13:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 626 transitions. [2025-03-04 11:13:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:13:58,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:58,314 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:58,321 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 11:13:58,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:13:58,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash -381304629, now seen corresponding path program 1 times [2025-03-04 11:13:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118222910] [2025-03-04 11:13:58,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:58,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:13:58,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:13:58,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:13:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118222910] [2025-03-04 11:13:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118222910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354883766] [2025-03-04 11:13:58,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:58,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:58,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:58,741 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 11:13:58,743 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 11:13:58,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:13:58,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:13:58,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:58,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:13:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:58,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:13:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354883766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:59,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:13:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208750385] [2025-03-04 11:13:59,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:13:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:59,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:13:59,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:13:59,237 INFO L87 Difference]: Start difference. First operand 546 states and 626 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:00,827 INFO L93 Difference]: Finished difference Result 716 states and 824 transitions. [2025-03-04 11:14:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 11:14:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-04 11:14:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:00,834 INFO L225 Difference]: With dead ends: 716 [2025-03-04 11:14:00,835 INFO L226 Difference]: Without dead ends: 713 [2025-03-04 11:14:00,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 11:14:00,837 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 275 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:00,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 516 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-04 11:14:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 608. [2025-03-04 11:14:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 485 states have (on average 1.1835051546391753) internal successors, (574), 488 states have internal predecessors, (574), 63 states have call successors, (63), 57 states have call predecessors, (63), 57 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 11:14:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 700 transitions. [2025-03-04 11:14:00,866 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 700 transitions. Word has length 86 [2025-03-04 11:14:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:00,866 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 700 transitions. [2025-03-04 11:14:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 700 transitions. [2025-03-04 11:14:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:14:00,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:00,869 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-04 11:14:00,875 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 11:14:01,069 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,SelfDestructingSolverStorable14 [2025-03-04 11:14:01,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:01,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash -707708897, now seen corresponding path program 1 times [2025-03-04 11:14:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:01,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-03-04 11:14:01,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:01,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:01,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:01,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:01,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 11:14:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-03-04 11:14:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153335464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667684616] [2025-03-04 11:14:01,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:01,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:01,335 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 11:14:01,337 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 11:14:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:14:01,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:01,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 11:14:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667684616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:01,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:01,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 28 [2025-03-04 11:14:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421911907] [2025-03-04 11:14:01,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 11:14:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:01,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 11:14:01,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:14:01,699 INFO L87 Difference]: Start difference. First operand 608 states and 700 transitions. Second operand has 28 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 11:14:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:02,270 INFO L93 Difference]: Finished difference Result 988 states and 1148 transitions. [2025-03-04 11:14:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 11:14:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 100 [2025-03-04 11:14:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:02,274 INFO L225 Difference]: With dead ends: 988 [2025-03-04 11:14:02,274 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 11:14:02,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 182 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=525, Invalid=2025, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:14:02,276 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 142 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:02,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 331 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 11:14:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 670. [2025-03-04 11:14:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 537 states have (on average 1.1638733705772812) internal successors, (625), 540 states have internal predecessors, (625), 68 states have call successors, (68), 62 states have call predecessors, (68), 62 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 11:14:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 761 transitions. [2025-03-04 11:14:02,317 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 761 transitions. Word has length 100 [2025-03-04 11:14:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:02,317 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 761 transitions. [2025-03-04 11:14:02,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 11:14:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 761 transitions. [2025-03-04 11:14:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:14:02,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:02,319 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2025-03-04 11:14:02,328 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 11:14:02,520 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,SelfDestructingSolverStorable15 [2025-03-04 11:14:02,520 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -740116513, now seen corresponding path program 1 times [2025-03-04 11:14:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-03-04 11:14:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:02,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:02,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:02,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 11:14:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-03-04 11:14:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726946089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531858594] [2025-03-04 11:14:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:02,785 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 11:14:02,787 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 11:14:02,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:02,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:02,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:02,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:14:02,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:03,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 11:14:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531858594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:03,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-04 11:14:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418315984] [2025-03-04 11:14:03,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:03,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:14:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:03,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:14:03,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:14:03,484 INFO L87 Difference]: Start difference. First operand 670 states and 761 transitions. Second operand has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-04 11:14:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:05,412 INFO L93 Difference]: Finished difference Result 952 states and 1096 transitions. [2025-03-04 11:14:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 11:14:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Word has length 106 [2025-03-04 11:14:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:05,419 INFO L225 Difference]: With dead ends: 952 [2025-03-04 11:14:05,419 INFO L226 Difference]: Without dead ends: 950 [2025-03-04 11:14:05,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3619 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2860, Invalid=11902, Unknown=0, NotChecked=0, Total=14762 [2025-03-04 11:14:05,424 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 412 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:05,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 521 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-03-04 11:14:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 699. [2025-03-04 11:14:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 560 states have (on average 1.175) internal successors, (658), 564 states have internal predecessors, (658), 71 states have call successors, (71), 65 states have call predecessors, (71), 65 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-04 11:14:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 800 transitions. [2025-03-04 11:14:05,456 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 800 transitions. Word has length 106 [2025-03-04 11:14:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 800 transitions. [2025-03-04 11:14:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-04 11:14:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 800 transitions. [2025-03-04 11:14:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 11:14:05,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:05,459 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 3, 3, 3, 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] [2025-03-04 11:14:05,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:05,659 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,SelfDestructingSolverStorable16 [2025-03-04 11:14:05,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1471924619, now seen corresponding path program 2 times [2025-03-04 11:14:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054733882] [2025-03-04 11:14:05,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:05,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-04 11:14:05,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 11:14:05,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 11:14:06,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054733882] [2025-03-04 11:14:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054733882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831203445] [2025-03-04 11:14:06,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:06,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:06,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:06,105 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 11:14:06,112 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 11:14:06,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-04 11:14:06,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 11:14:06,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:06,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:14:06,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:06,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 11:14:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831203445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:06,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:06,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 52 [2025-03-04 11:14:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814939372] [2025-03-04 11:14:06,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:06,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 11:14:06,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:06,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 11:14:06,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2209, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 11:14:06,725 INFO L87 Difference]: Start difference. First operand 699 states and 800 transitions. Second operand has 53 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 53 states have internal predecessors, (166), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2025-03-04 11:14:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:08,308 INFO L93 Difference]: Finished difference Result 1537 states and 1794 transitions. [2025-03-04 11:14:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-04 11:14:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 53 states have internal predecessors, (166), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) Word has length 130 [2025-03-04 11:14:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:08,315 INFO L225 Difference]: With dead ends: 1537 [2025-03-04 11:14:08,315 INFO L226 Difference]: Without dead ends: 1179 [2025-03-04 11:14:08,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2506, Invalid=10604, Unknown=0, NotChecked=0, Total=13110 [2025-03-04 11:14:08,320 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 442 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:08,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 561 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-03-04 11:14:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 849. [2025-03-04 11:14:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 680 states have (on average 1.1823529411764706) internal successors, (804), 684 states have internal predecessors, (804), 86 states have call successors, (86), 80 states have call predecessors, (86), 80 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 11:14:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 976 transitions. [2025-03-04 11:14:08,360 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 976 transitions. Word has length 130 [2025-03-04 11:14:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:08,360 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 976 transitions. [2025-03-04 11:14:08,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 53 states have internal predecessors, (166), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2025-03-04 11:14:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 976 transitions. [2025-03-04 11:14:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:14:08,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:08,364 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:08,371 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 11:14:08,565 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,SelfDestructingSolverStorable17 [2025-03-04 11:14:08,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1557861874, now seen corresponding path program 2 times [2025-03-04 11:14:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925615786] [2025-03-04 11:14:08,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:08,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 146 statements into 2 equivalence classes. [2025-03-04 11:14:08,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:14:08,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-04 11:14:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925615786] [2025-03-04 11:14:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925615786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691057873] [2025-03-04 11:14:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:08,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:08,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:08,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:08,724 INFO L87 Difference]: Start difference. First operand 849 states and 976 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:08,811 INFO L93 Difference]: Finished difference Result 866 states and 993 transitions. [2025-03-04 11:14:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 146 [2025-03-04 11:14:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:08,815 INFO L225 Difference]: With dead ends: 866 [2025-03-04 11:14:08,815 INFO L226 Difference]: Without dead ends: 865 [2025-03-04 11:14:08,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:14:08,816 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:08,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-04 11:14:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 776. [2025-03-04 11:14:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 621 states have (on average 1.1755233494363928) internal successors, (730), 625 states have internal predecessors, (730), 79 states have call successors, (79), 73 states have call predecessors, (79), 73 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 11:14:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 888 transitions. [2025-03-04 11:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 888 transitions. Word has length 146 [2025-03-04 11:14:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:08,850 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 888 transitions. [2025-03-04 11:14:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 888 transitions. [2025-03-04 11:14:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 11:14:08,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:08,852 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:08,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:14:08,852 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1398584969, now seen corresponding path program 3 times [2025-03-04 11:14:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29221280] [2025-03-04 11:14:08,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:14:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:08,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 150 statements into 10 equivalence classes. [2025-03-04 11:14:08,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 150 statements. [2025-03-04 11:14:08,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:14:08,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-04 11:14:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29221280] [2025-03-04 11:14:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29221280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:08,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:14:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499771680] [2025-03-04 11:14:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:08,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:14:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:08,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:14:08,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:14:08,928 INFO L87 Difference]: Start difference. First operand 776 states and 888 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:09,041 INFO L93 Difference]: Finished difference Result 793 states and 906 transitions. [2025-03-04 11:14:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 150 [2025-03-04 11:14:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:09,045 INFO L225 Difference]: With dead ends: 793 [2025-03-04 11:14:09,045 INFO L226 Difference]: Without dead ends: 792 [2025-03-04 11:14:09,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:09,046 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:09,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 179 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-04 11:14:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 492. [2025-03-04 11:14:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 393 states have (on average 1.1424936386768447) internal successors, (449), 398 states have internal predecessors, (449), 51 states have call successors, (51), 45 states have call predecessors, (51), 45 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 11:14:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 551 transitions. [2025-03-04 11:14:09,072 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 551 transitions. Word has length 150 [2025-03-04 11:14:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:09,073 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 551 transitions. [2025-03-04 11:14:09,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 551 transitions. [2025-03-04 11:14:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 11:14:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:09,075 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 10, 10, 9, 9, 9, 9, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:14:09,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -333555862, now seen corresponding path program 1 times [2025-03-04 11:14:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503429216] [2025-03-04 11:14:09,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:09,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:09,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:09,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-04 11:14:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503429216] [2025-03-04 11:14:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503429216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415190402] [2025-03-04 11:14:09,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:09,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:09,194 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 11:14:09,196 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 11:14:09,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:14:09,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 533 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 11:14:09,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 233 proven. 6 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-04 11:14:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415190402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:09,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 24] total 29 [2025-03-04 11:14:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632816804] [2025-03-04 11:14:09,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:09,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:14:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:09,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:14:09,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:14:09,928 INFO L87 Difference]: Start difference. First operand 492 states and 551 transitions. Second operand has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2025-03-04 11:14:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:11,282 INFO L93 Difference]: Finished difference Result 814 states and 923 transitions. [2025-03-04 11:14:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 11:14:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) Word has length 156 [2025-03-04 11:14:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:11,284 INFO L225 Difference]: With dead ends: 814 [2025-03-04 11:14:11,284 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 11:14:11,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 269 SyntacticMatches, 21 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1130, Invalid=4876, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 11:14:11,286 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 160 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:11,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 790 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 11:14:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 268. [2025-03-04 11:14:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.136150234741784) internal successors, (242), 214 states have internal predecessors, (242), 28 states have call successors, (28), 25 states have call predecessors, (28), 25 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 11:14:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 298 transitions. [2025-03-04 11:14:11,300 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 298 transitions. Word has length 156 [2025-03-04 11:14:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 298 transitions. [2025-03-04 11:14:11,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2025-03-04 11:14:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 298 transitions. [2025-03-04 11:14:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 11:14:11,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:11,302 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 10, 10, 10, 9, 4, 4, 4, 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] [2025-03-04 11:14:11,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:14:11,506 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,SelfDestructingSolverStorable20 [2025-03-04 11:14:11,506 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2010221641, now seen corresponding path program 1 times [2025-03-04 11:14:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343699607] [2025-03-04 11:14:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 11:14:11,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-04 11:14:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343699607] [2025-03-04 11:14:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343699607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24463190] [2025-03-04 11:14:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:11,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:11,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:11,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:11,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:11,573 INFO L87 Difference]: Start difference. First operand 268 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:11,603 INFO L93 Difference]: Finished difference Result 424 states and 480 transitions. [2025-03-04 11:14:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:11,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 160 [2025-03-04 11:14:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:11,606 INFO L225 Difference]: With dead ends: 424 [2025-03-04 11:14:11,606 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 11:14:11,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 11:14:11,607 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:11,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 11:14:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-03-04 11:14:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 184 states have (on average 1.0815217391304348) internal successors, (199), 185 states have internal predecessors, (199), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 11:14:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 247 transitions. [2025-03-04 11:14:11,621 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 247 transitions. Word has length 160 [2025-03-04 11:14:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:11,621 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 247 transitions. [2025-03-04 11:14:11,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 247 transitions. [2025-03-04 11:14:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:14:11,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:11,622 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 4, 4, 4, 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 11:14:11,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:14:11,623 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:11,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1090895071, now seen corresponding path program 2 times [2025-03-04 11:14:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111263051] [2025-03-04 11:14:11,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:11,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 11:14:11,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:14:11,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:11,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 163 proven. 7 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-04 11:14:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111263051] [2025-03-04 11:14:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111263051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872904175] [2025-03-04 11:14:11,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:11,821 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 11:14:11,823 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 11:14:11,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 11:14:11,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:14:11,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:11,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:14:11,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 913 proven. 9 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 11:14:12,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 533 proven. 9 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 11:14:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872904175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:12,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 24] total 32 [2025-03-04 11:14:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391516482] [2025-03-04 11:14:12,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:12,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:14:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:12,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:14:12,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:14:12,597 INFO L87 Difference]: Start difference. First operand 231 states and 247 transitions. Second operand has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) [2025-03-04 11:14:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:13,803 INFO L93 Difference]: Finished difference Result 370 states and 402 transitions. [2025-03-04 11:14:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 11:14:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) Word has length 180 [2025-03-04 11:14:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:13,805 INFO L225 Difference]: With dead ends: 370 [2025-03-04 11:14:13,805 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 11:14:13,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 316 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=963, Invalid=3593, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 11:14:13,806 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 73 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:13,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 706 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 11:14:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2025-03-04 11:14:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.0677083333333333) internal successors, (205), 192 states have internal predecessors, (205), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 11:14:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2025-03-04 11:14:13,819 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 180 [2025-03-04 11:14:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:13,819 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2025-03-04 11:14:13,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.25) internal successors, (136), 32 states have internal predecessors, (136), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) [2025-03-04 11:14:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2025-03-04 11:14:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 11:14:13,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:13,822 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 4, 4, 4, 3, 3, 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 11:14:13,829 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 11:14:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:14,026 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1698814501, now seen corresponding path program 1 times [2025-03-04 11:14:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093983832] [2025-03-04 11:14:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:14,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 11:14:14,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 11:14:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 713 proven. 7 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2025-03-04 11:14:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:14,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093983832] [2025-03-04 11:14:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093983832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:14,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100568898] [2025-03-04 11:14:14,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:14,430 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 11:14:14,431 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 11:14:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 11:14:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 11:14:14,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:14,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:14,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:14:14,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-03-04 11:14:14,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100568898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 24 [2025-03-04 11:14:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135434832] [2025-03-04 11:14:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:14:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:14,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:14:14,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:14:14,560 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:14,598 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2025-03-04 11:14:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:14:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 232 [2025-03-04 11:14:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:14,599 INFO L225 Difference]: With dead ends: 248 [2025-03-04 11:14:14,599 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:14:14,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:14:14,600 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:14,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:14:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:14:14,601 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 11:14:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:14:14,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2025-03-04 11:14:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:14,601 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:14:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:14:14,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:14:14,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:14:14,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:14:14,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:14,808 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:14:27,236 WARN L286 SmtUtils]: Spent 11.18s on a formula simplification. DAG size of input: 189 DAG size of output: 41 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-04 11:14:28,086 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:14:28,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:14:28 BoogieIcfgContainer [2025-03-04 11:14:28,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:14:28,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:14:28,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:14:28,096 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:14:28,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:45" (3/4) ... [2025-03-04 11:14:28,098 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:14:28,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:14:28,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:14:28,106 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 11:14:28,106 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 11:14:28,106 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:14:28,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:14:28,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:14:28,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:14:28,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:14:28,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:14:28,171 INFO L158 Benchmark]: Toolchain (without parser) took 43135.85ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 106.1MB in the beginning and 339.3MB in the end (delta: -233.2MB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,172 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:28,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.79ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.39ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,172 INFO L158 Benchmark]: Boogie Preprocessor took 28.60ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.9MB in the end (delta: 951.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:14:28,172 INFO L158 Benchmark]: IcfgBuilder took 312.04ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 77.7MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,173 INFO L158 Benchmark]: TraceAbstraction took 42493.13ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 77.7MB in the beginning and 343.6MB in the end (delta: -266.0MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,173 INFO L158 Benchmark]: Witness Printer took 74.52ms. Allocated memory is still 620.8MB. Free memory was 343.6MB in the beginning and 339.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:14:28,174 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.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.79ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.39ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.60ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.9MB in the end (delta: 951.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.04ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 77.7MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42493.13ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 77.7MB in the beginning and 343.6MB in the end (delta: -266.0MB). Peak memory consumption was 341.2MB. Max. memory is 16.1GB. * Witness Printer took 74.52ms. Allocated memory is still 620.8MB. Free memory was 343.6MB in the beginning and 339.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: 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, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 24, TraceHistogramMax: 19, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2924 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2918 mSDsluCounter, 7242 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6217 mSDsCounter, 352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6146 IncrementalHoareTripleChecker+Invalid, 6498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 352 mSolverCounterUnsat, 1025 mSDtfsCounter, 6146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3326 GetRequests, 2337 SyntacticMatches, 54 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17654 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=849occurred in iteration=18, InterpolantAutomatonStates: 732, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1489 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3644 NumberOfCodeBlocks, 3539 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4744 ConstructedInterpolants, 0 QuantifiedInterpolants, 9284 SizeOfPredicates, 161 NumberOfNonLiveVariables, 3431 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 12044/13908 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 6 specifications checked. All of them hold - InvariantResult [Line: 44]: Location Invariant Derived location invariant: ((((((counter == 3) || (counter == 5)) || (counter == 4)) || ((y != x) && (counter == 1))) || ((counter <= 10) && (6 <= counter))) || (counter == 2)) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((counter <= 10) && (3 <= counter)) || (counter == 11)) || (((2 <= counter) && (counter <= 10)) && (x <= y))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((12 <= counter) && (counter <= 2147483646)) || (counter == 0)) || (((counter <= 2147483646) && (x <= y)) && (3 <= counter))) || ((4 <= counter) && ((counter < 11) || (counter == 11)))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:14:28,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE