./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.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/cohencu-ll_unwindbound5.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 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:52:58,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:52:58,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:52:58,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:52:58,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:52:58,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:52:58,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:52:58,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:52:58,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:52:58,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:52:58,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:52:58,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:52:58,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:52:58,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:52:58,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:52:58,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:52:58,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:52:58,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:52:58,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:52:58,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:52:58,298 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 -> 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 [2025-03-04 10:52:58,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:52:58,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:52:58,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:52:58,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:52:58,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:52:58,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2025-03-04 10:52:59,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c7bce42/07ffa3cf1acf4d67b444e55f741c885d/FLAG56ddc62b1 [2025-03-04 10:52:59,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:52:59,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2025-03-04 10:52:59,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c7bce42/07ffa3cf1acf4d67b444e55f741c885d/FLAG56ddc62b1 [2025-03-04 10:53:00,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c7bce42/07ffa3cf1acf4d67b444e55f741c885d [2025-03-04 10:53:00,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:53:00,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:53:00,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:00,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:53:00,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:53:00,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef5da1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00, skipping insertion in model container [2025-03-04 10:53:00,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:53:00,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:00,285 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:53:00,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:00,316 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:53:00,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00 WrapperNode [2025-03-04 10:53:00,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:00,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:00,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:53:00,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:53:00,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,344 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-04 10:53:00,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:00,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:53:00,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:53:00,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:53:00,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,359 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:53:00,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:53:00,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:53:00,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:53:00,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:53:00,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (1/1) ... [2025-03-04 10:53:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:00,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:53:00,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:53:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:53:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:53:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:53:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:53:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:53:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:53:00,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:53:00,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:53:00,976 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-04 10:53:00,976 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:53:00,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:53:00,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:53:00,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:00 BoogieIcfgContainer [2025-03-04 10:53:00,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:53:00,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:53:00,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:53:01,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:53:01,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:53:00" (1/3) ... [2025-03-04 10:53:01,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:01, skipping insertion in model container [2025-03-04 10:53:01,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:00" (2/3) ... [2025-03-04 10:53:01,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:01, skipping insertion in model container [2025-03-04 10:53:01,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:00" (3/3) ... [2025-03-04 10:53:01,004 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2025-03-04 10:53:01,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:53:01,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound5.c that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-03-04 10:53:01,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:53:01,078 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;@2e9f1e71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:53:01,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-03-04 10:53:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:53:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:53:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:53:01,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 10188447, now seen corresponding path program 1 times [2025-03-04 10:53:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907355447] [2025-03-04 10:53:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:53:01,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:53:01,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907355447] [2025-03-04 10:53:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907355447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273402891] [2025-03-04 10:53:01,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:01,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:01,309 INFO L87 Difference]: Start difference. First operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,400 INFO L93 Difference]: Finished difference Result 606 states and 654 transitions. [2025-03-04 10:53:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:01,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 10:53:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,407 INFO L225 Difference]: With dead ends: 606 [2025-03-04 10:53:01,407 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:53:01,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:01,411 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 4 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 909 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:53:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 10:53:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 152 states have (on average 1.881578947368421) internal successors, (286), 284 states have internal predecessors, (286), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:53:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 306 transitions. [2025-03-04 10:53:01,453 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 306 transitions. Word has length 4 [2025-03-04 10:53:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 306 transitions. [2025-03-04 10:53:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 306 transitions. [2025-03-04 10:53:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:53:01,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:53:01,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1418391353, now seen corresponding path program 1 times [2025-03-04 10:53:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340487309] [2025-03-04 10:53:01,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:53:01,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:53:01,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:01,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340487309] [2025-03-04 10:53:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340487309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017624856] [2025-03-04 10:53:01,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:01,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,499 INFO L87 Difference]: Start difference. First operand 296 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,620 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-03-04 10:53:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:53:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,623 INFO L225 Difference]: With dead ends: 564 [2025-03-04 10:53:01,623 INFO L226 Difference]: Without dead ends: 544 [2025-03-04 10:53:01,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,627 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 237 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 581 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-04 10:53:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 354. [2025-03-04 10:53:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 205 states have (on average 1.7902439024390244) internal successors, (367), 337 states have internal predecessors, (367), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:53:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 397 transitions. [2025-03-04 10:53:01,659 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 397 transitions. Word has length 7 [2025-03-04 10:53:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,659 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 397 transitions. [2025-03-04 10:53:01,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 397 transitions. [2025-03-04 10:53:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:53:01,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:53:01,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1941662720, now seen corresponding path program 1 times [2025-03-04 10:53:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641237650] [2025-03-04 10:53:01,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:53:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:53:01,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807167189] [2025-03-04 10:53:01,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:01,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:01,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:53:01,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:53:01,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:53:01,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:01,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:01,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641237650] [2025-03-04 10:53:01,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807167189] [2025-03-04 10:53:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807167189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901252397] [2025-03-04 10:53:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:01,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,874 INFO L87 Difference]: Start difference. First operand 354 states and 397 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:02,317 INFO L93 Difference]: Finished difference Result 514 states and 572 transitions. [2025-03-04 10:53:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 10:53:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:02,319 INFO L225 Difference]: With dead ends: 514 [2025-03-04 10:53:02,320 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 10:53:02,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:02,320 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 134 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:02,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 371 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 10:53:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 439. [2025-03-04 10:53:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.6491228070175439) internal successors, (470), 417 states have internal predecessors, (470), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 510 transitions. [2025-03-04 10:53:02,338 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 510 transitions. Word has length 40 [2025-03-04 10:53:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 510 transitions. [2025-03-04 10:53:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 510 transitions. [2025-03-04 10:53:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:53:02,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:02,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:02,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:53:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:02,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1922060450, now seen corresponding path program 1 times [2025-03-04 10:53:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891141573] [2025-03-04 10:53:02,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:02,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:53:02,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:53:02,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891141573] [2025-03-04 10:53:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891141573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:02,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602405420] [2025-03-04 10:53:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:02,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:02,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:02,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:02,636 INFO L87 Difference]: Start difference. First operand 439 states and 510 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:02,891 INFO L93 Difference]: Finished difference Result 472 states and 517 transitions. [2025-03-04 10:53:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:02,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 10:53:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:02,893 INFO L225 Difference]: With dead ends: 472 [2025-03-04 10:53:02,893 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:53:02,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:02,894 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 120 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:02,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 487 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:53:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:53:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.568421052631579) internal successors, (447), 417 states have internal predecessors, (447), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 487 transitions. [2025-03-04 10:53:02,907 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 487 transitions. Word has length 42 [2025-03-04 10:53:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 487 transitions. [2025-03-04 10:53:02,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 487 transitions. [2025-03-04 10:53:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:53:02,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:02,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:53:02,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:02,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -264148292, now seen corresponding path program 1 times [2025-03-04 10:53:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060384627] [2025-03-04 10:53:02,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:53:02,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:53:02,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:02,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060384627] [2025-03-04 10:53:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060384627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:02,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763712574] [2025-03-04 10:53:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:02,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:02,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:02,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:02,999 INFO L87 Difference]: Start difference. First operand 439 states and 487 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:03,556 INFO L93 Difference]: Finished difference Result 451 states and 494 transitions. [2025-03-04 10:53:03,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:03,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-04 10:53:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:03,559 INFO L225 Difference]: With dead ends: 451 [2025-03-04 10:53:03,559 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:53:03,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:03,559 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 140 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:03,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 528 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:53:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:53:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5614035087719298) internal successors, (445), 417 states have internal predecessors, (445), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 485 transitions. [2025-03-04 10:53:03,569 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 485 transitions. Word has length 44 [2025-03-04 10:53:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 485 transitions. [2025-03-04 10:53:03,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 485 transitions. [2025-03-04 10:53:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:53:03,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:03,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:53:03,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 401337751, now seen corresponding path program 1 times [2025-03-04 10:53:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879160688] [2025-03-04 10:53:03,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:03,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:53:03,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:53:03,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:03,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879160688] [2025-03-04 10:53:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879160688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084718716] [2025-03-04 10:53:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:03,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:03,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:03,642 INFO L87 Difference]: Start difference. First operand 439 states and 485 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:03,925 INFO L93 Difference]: Finished difference Result 451 states and 492 transitions. [2025-03-04 10:53:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-04 10:53:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:03,927 INFO L225 Difference]: With dead ends: 451 [2025-03-04 10:53:03,928 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:53:03,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:03,929 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 255 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:03,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 452 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:53:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:53:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5543859649122806) internal successors, (443), 417 states have internal predecessors, (443), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 483 transitions. [2025-03-04 10:53:03,940 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 483 transitions. Word has length 45 [2025-03-04 10:53:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:03,940 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 483 transitions. [2025-03-04 10:53:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 483 transitions. [2025-03-04 10:53:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:53:03,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:03,941 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:53:03,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:03,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash -935804552, now seen corresponding path program 1 times [2025-03-04 10:53:03,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:03,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36983682] [2025-03-04 10:53:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:53:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:53:03,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248909567] [2025-03-04 10:53:03,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:03,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:03,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:03,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:53:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:53:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:53:03,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:03,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:04,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36983682] [2025-03-04 10:53:04,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:04,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248909567] [2025-03-04 10:53:04,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248909567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:04,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:04,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:04,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214707534] [2025-03-04 10:53:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:04,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,191 INFO L87 Difference]: Start difference. First operand 439 states and 483 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,487 INFO L93 Difference]: Finished difference Result 456 states and 490 transitions. [2025-03-04 10:53:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-04 10:53:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,490 INFO L225 Difference]: With dead ends: 456 [2025-03-04 10:53:04,490 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 10:53:04,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,491 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 112 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 283 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 10:53:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 442. [2025-03-04 10:53:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5277777777777777) internal successors, (440), 420 states have internal predecessors, (440), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 480 transitions. [2025-03-04 10:53:04,504 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 480 transitions. Word has length 48 [2025-03-04 10:53:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 480 transitions. [2025-03-04 10:53:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 480 transitions. [2025-03-04 10:53:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:53:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:04,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:04,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:04,707 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 10:53:04,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1054830163, now seen corresponding path program 1 times [2025-03-04 10:53:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677017108] [2025-03-04 10:53:04,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:04,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:53:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:53:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:04,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677017108] [2025-03-04 10:53:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677017108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:04,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:04,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250381603] [2025-03-04 10:53:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:04,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:04,790 INFO L87 Difference]: Start difference. First operand 442 states and 480 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,151 INFO L93 Difference]: Finished difference Result 455 states and 481 transitions. [2025-03-04 10:53:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-04 10:53:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,154 INFO L225 Difference]: With dead ends: 455 [2025-03-04 10:53:05,154 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:53:05,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,154 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 417 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:53:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 442. [2025-03-04 10:53:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5069444444444444) internal successors, (434), 420 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 474 transitions. [2025-03-04 10:53:05,176 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 474 transitions. Word has length 49 [2025-03-04 10:53:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,176 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 474 transitions. [2025-03-04 10:53:05,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 474 transitions. [2025-03-04 10:53:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:53:05,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:53:05,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -899125489, now seen corresponding path program 1 times [2025-03-04 10:53:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609075926] [2025-03-04 10:53:05,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:53:05,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:53:05,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609075926] [2025-03-04 10:53:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609075926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017015604] [2025-03-04 10:53:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:05,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,259 INFO L87 Difference]: Start difference. First operand 442 states and 474 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,700 INFO L93 Difference]: Finished difference Result 453 states and 475 transitions. [2025-03-04 10:53:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:05,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-04 10:53:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,702 INFO L225 Difference]: With dead ends: 453 [2025-03-04 10:53:05,702 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 10:53:05,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,703 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 119 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 433 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 10:53:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-04 10:53:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 357 states have internal predecessors, (365), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 399 transitions. [2025-03-04 10:53:05,711 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 399 transitions. Word has length 53 [2025-03-04 10:53:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 399 transitions. [2025-03-04 10:53:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 399 transitions. [2025-03-04 10:53:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:53:05,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:53:05,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:05,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1828896756, now seen corresponding path program 1 times [2025-03-04 10:53:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610242288] [2025-03-04 10:53:05,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:05,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:05,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610242288] [2025-03-04 10:53:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610242288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409854182] [2025-03-04 10:53:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:05,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:05,778 INFO L87 Difference]: Start difference. First operand 376 states and 399 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,987 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2025-03-04 10:53:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 10:53:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,988 INFO L225 Difference]: With dead ends: 376 [2025-03-04 10:53:05,988 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:05,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:05,989 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 159 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-04 10:53:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 225 states have (on average 1.5911111111111111) internal successors, (358), 350 states have internal predecessors, (358), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 392 transitions. [2025-03-04 10:53:05,997 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 392 transitions. Word has length 85 [2025-03-04 10:53:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,997 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 392 transitions. [2025-03-04 10:53:05,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 392 transitions. [2025-03-04 10:53:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:05,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,998 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:53:05,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -861224441, now seen corresponding path program 1 times [2025-03-04 10:53:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117101353] [2025-03-04 10:53:05,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:06,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:06,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117101353] [2025-03-04 10:53:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117101353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588037860] [2025-03-04 10:53:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:06,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:06,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:06,057 INFO L87 Difference]: Start difference. First operand 369 states and 392 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:06,259 INFO L93 Difference]: Finished difference Result 376 states and 395 transitions. [2025-03-04 10:53:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-04 10:53:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:06,261 INFO L225 Difference]: With dead ends: 376 [2025-03-04 10:53:06,262 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 10:53:06,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:06,263 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 24 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:06,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 428 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 10:53:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-03-04 10:53:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 227 states have (on average 1.5859030837004404) internal successors, (360), 352 states have internal predecessors, (360), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 394 transitions. [2025-03-04 10:53:06,272 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 394 transitions. Word has length 86 [2025-03-04 10:53:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:06,273 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 394 transitions. [2025-03-04 10:53:06,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 394 transitions. [2025-03-04 10:53:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:53:06,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:06,274 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:06,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:53:06,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1376228870, now seen corresponding path program 1 times [2025-03-04 10:53:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643380167] [2025-03-04 10:53:06,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:06,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:06,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643380167] [2025-03-04 10:53:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643380167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:06,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432977544] [2025-03-04 10:53:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:06,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:06,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:06,356 INFO L87 Difference]: Start difference. First operand 371 states and 394 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:06,442 INFO L93 Difference]: Finished difference Result 371 states and 394 transitions. [2025-03-04 10:53:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2025-03-04 10:53:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:06,444 INFO L225 Difference]: With dead ends: 371 [2025-03-04 10:53:06,444 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:06,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:06,445 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 195 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 267 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-04 10:53:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 227 states have (on average 1.5682819383259912) internal successors, (356), 350 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 390 transitions. [2025-03-04 10:53:06,455 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 390 transitions. Word has length 88 [2025-03-04 10:53:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 390 transitions. [2025-03-04 10:53:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 390 transitions. [2025-03-04 10:53:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 10:53:06,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:06,457 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:53:06,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -286577856, now seen corresponding path program 1 times [2025-03-04 10:53:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578272457] [2025-03-04 10:53:06,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:06,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:06,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:06,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578272457] [2025-03-04 10:53:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578272457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:06,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:06,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790827260] [2025-03-04 10:53:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:06,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:06,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:06,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:06,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:06,541 INFO L87 Difference]: Start difference. First operand 369 states and 390 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:06,709 INFO L93 Difference]: Finished difference Result 373 states and 390 transitions. [2025-03-04 10:53:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2025-03-04 10:53:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:06,712 INFO L225 Difference]: With dead ends: 373 [2025-03-04 10:53:06,712 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:06,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:06,712 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 48 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:06,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 738 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2025-03-04 10:53:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 225 states have (on average 1.5644444444444445) internal successors, (352), 348 states have internal predecessors, (352), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 386 transitions. [2025-03-04 10:53:06,723 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 386 transitions. Word has length 89 [2025-03-04 10:53:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 386 transitions. [2025-03-04 10:53:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 386 transitions. [2025-03-04 10:53:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:53:06,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:06,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:53:06,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:06,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1292008901, now seen corresponding path program 1 times [2025-03-04 10:53:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521588134] [2025-03-04 10:53:06,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:06,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:06,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:06,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521588134] [2025-03-04 10:53:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521588134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969667034] [2025-03-04 10:53:06,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:06,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:06,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:53:06,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:06,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:06,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:06,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:07,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969667034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:53:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985137697] [2025-03-04 10:53:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:07,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:07,010 INFO L87 Difference]: Start difference. First operand 367 states and 386 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,042 INFO L93 Difference]: Finished difference Result 367 states and 386 transitions. [2025-03-04 10:53:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:07,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2025-03-04 10:53:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,044 INFO L225 Difference]: With dead ends: 367 [2025-03-04 10:53:07,044 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 10:53:07,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:07,045 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 856 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 10:53:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-04 10:53:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 225 states have (on average 1.56) internal successors, (351), 347 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 385 transitions. [2025-03-04 10:53:07,058 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 385 transitions. Word has length 88 [2025-03-04 10:53:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 385 transitions. [2025-03-04 10:53:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 385 transitions. [2025-03-04 10:53:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 10:53:07,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,059 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:07,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:07,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1397570531, now seen corresponding path program 1 times [2025-03-04 10:53:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13855806] [2025-03-04 10:53:07,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:07,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:07,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:07,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13855806] [2025-03-04 10:53:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13855806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77964795] [2025-03-04 10:53:07,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:07,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:53:07,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:07,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:07,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:07,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77964795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:53:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751181141] [2025-03-04 10:53:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:07,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:07,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:07,579 INFO L87 Difference]: Start difference. First operand 366 states and 385 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,645 INFO L93 Difference]: Finished difference Result 535 states and 557 transitions. [2025-03-04 10:53:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-03-04 10:53:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,647 INFO L225 Difference]: With dead ends: 535 [2025-03-04 10:53:07,647 INFO L226 Difference]: Without dead ends: 534 [2025-03-04 10:53:07,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:07,648 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 221 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1499 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-04 10:53:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-03-04 10:53:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 296 states have (on average 1.6283783783783783) internal successors, (482), 418 states have internal predecessors, (482), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 526 transitions. [2025-03-04 10:53:07,662 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 526 transitions. Word has length 89 [2025-03-04 10:53:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,662 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 526 transitions. [2025-03-04 10:53:07,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 526 transitions. [2025-03-04 10:53:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:53:07,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:53:07,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1259474975, now seen corresponding path program 1 times [2025-03-04 10:53:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011712023] [2025-03-04 10:53:07,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:53:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:53:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:07,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011712023] [2025-03-04 10:53:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011712023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544941677] [2025-03-04 10:53:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:07,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:07,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:53:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:53:07,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:53:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:07,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:08,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544941677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:53:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474608420] [2025-03-04 10:53:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:08,084 INFO L87 Difference]: Start difference. First operand 442 states and 526 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,198 INFO L93 Difference]: Finished difference Result 444 states and 526 transitions. [2025-03-04 10:53:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 91 [2025-03-04 10:53:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,202 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:53:08,202 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 10:53:08,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:08,203 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 255 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 375 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 10:53:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-04 10:53:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 296 states have (on average 1.5945945945945945) internal successors, (472), 410 states have internal predecessors, (472), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2025-03-04 10:53:08,216 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 91 [2025-03-04 10:53:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,217 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2025-03-04 10:53:08,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2025-03-04 10:53:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:53:08,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,218 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:53:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:53:08,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -389018303, now seen corresponding path program 1 times [2025-03-04 10:53:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885188120] [2025-03-04 10:53:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:08,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:53:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:53:08,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885188120] [2025-03-04 10:53:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885188120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399975545] [2025-03-04 10:53:08,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:08,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:08,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:53:08,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:53:08,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:53:08,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:08,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:08,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399975545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:08,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:08,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:53:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972087158] [2025-03-04 10:53:08,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:08,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:08,708 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,878 INFO L93 Difference]: Finished difference Result 779 states and 948 transitions. [2025-03-04 10:53:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 92 [2025-03-04 10:53:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,881 INFO L225 Difference]: With dead ends: 779 [2025-03-04 10:53:08,881 INFO L226 Difference]: Without dead ends: 771 [2025-03-04 10:53:08,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:08,882 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 458 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 974 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-04 10:53:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 505. [2025-03-04 10:53:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 367 states have (on average 1.561307901907357) internal successors, (573), 476 states have internal predecessors, (573), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:53:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 627 transitions. [2025-03-04 10:53:08,896 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 627 transitions. Word has length 92 [2025-03-04 10:53:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,896 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 627 transitions. [2025-03-04 10:53:08,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 627 transitions. [2025-03-04 10:53:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 10:53:08,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:53:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:53:09,098 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -607411062, now seen corresponding path program 1 times [2025-03-04 10:53:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089322426] [2025-03-04 10:53:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:53:09,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:53:09,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089322426] [2025-03-04 10:53:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089322426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638250025] [2025-03-04 10:53:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:09,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:09,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:53:09,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:53:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:53:09,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:09,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:09,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:09,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638250025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:09,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:09,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-04 10:53:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690344269] [2025-03-04 10:53:09,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:53:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:53:09,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:09,410 INFO L87 Difference]: Start difference. First operand 505 states and 627 transitions. Second operand has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:53:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,581 INFO L93 Difference]: Finished difference Result 1136 states and 1237 transitions. [2025-03-04 10:53:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:53:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 101 [2025-03-04 10:53:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,584 INFO L225 Difference]: With dead ends: 1136 [2025-03-04 10:53:09,584 INFO L226 Difference]: Without dead ends: 966 [2025-03-04 10:53:09,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:53:09,585 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 514 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1575 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-04 10:53:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 719. [2025-03-04 10:53:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 563 states have (on average 1.6287744227353464) internal successors, (917), 674 states have internal predecessors, (917), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:53:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1001 transitions. [2025-03-04 10:53:09,604 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1001 transitions. Word has length 101 [2025-03-04 10:53:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,604 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1001 transitions. [2025-03-04 10:53:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:53:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1001 transitions. [2025-03-04 10:53:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:53:09,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,605 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:53:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:09,810 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 979995133, now seen corresponding path program 1 times [2025-03-04 10:53:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450805420] [2025-03-04 10:53:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:09,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:09,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:09,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37503530] [2025-03-04 10:53:09,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:09,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:09,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:09,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:53:09,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:09,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:09,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:09,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450805420] [2025-03-04 10:53:10,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37503530] [2025-03-04 10:53:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37503530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:10,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:53:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108867746] [2025-03-04 10:53:10,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:10,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:10,079 INFO L87 Difference]: Start difference. First operand 719 states and 1001 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:10,249 INFO L93 Difference]: Finished difference Result 928 states and 1061 transitions. [2025-03-04 10:53:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2025-03-04 10:53:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:10,253 INFO L225 Difference]: With dead ends: 928 [2025-03-04 10:53:10,253 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 10:53:10,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:10,254 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1089 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:10,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 954 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 10:53:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 714. [2025-03-04 10:53:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 563 states have (on average 1.6056838365896982) internal successors, (904), 669 states have internal predecessors, (904), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:53:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 988 transitions. [2025-03-04 10:53:10,273 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 988 transitions. Word has length 103 [2025-03-04 10:53:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 988 transitions. [2025-03-04 10:53:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 988 transitions. [2025-03-04 10:53:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 10:53:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,275 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:10,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -759090339, now seen corresponding path program 1 times [2025-03-04 10:53:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894859951] [2025-03-04 10:53:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:10,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:10,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402554796] [2025-03-04 10:53:10,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:53:10,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:10,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:10,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:10,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:10,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894859951] [2025-03-04 10:53:10,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402554796] [2025-03-04 10:53:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402554796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:10,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:10,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246129887] [2025-03-04 10:53:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:10,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:10,646 INFO L87 Difference]: Start difference. First operand 714 states and 988 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:10,864 INFO L93 Difference]: Finished difference Result 715 states and 988 transitions. [2025-03-04 10:53:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2025-03-04 10:53:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:10,867 INFO L225 Difference]: With dead ends: 715 [2025-03-04 10:53:10,868 INFO L226 Difference]: Without dead ends: 714 [2025-03-04 10:53:10,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:10,868 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 73 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:10,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 355 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-04 10:53:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2025-03-04 10:53:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 563 states have (on average 1.6039076376554173) internal successors, (903), 669 states have internal predecessors, (903), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:53:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 987 transitions. [2025-03-04 10:53:10,892 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 987 transitions. Word has length 105 [2025-03-04 10:53:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 987 transitions. [2025-03-04 10:53:10,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 987 transitions. [2025-03-04 10:53:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 10:53:10,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,894 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:53:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,094 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2056963920, now seen corresponding path program 1 times [2025-03-04 10:53:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836626769] [2025-03-04 10:53:11,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:53:11,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:53:11,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078553772] [2025-03-04 10:53:11,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:11,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:11,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:53:11,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:53:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:53:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:11,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:11,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836626769] [2025-03-04 10:53:11,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078553772] [2025-03-04 10:53:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078553772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:11,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393711534] [2025-03-04 10:53:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:11,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:11,353 INFO L87 Difference]: Start difference. First operand 714 states and 987 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,659 INFO L93 Difference]: Finished difference Result 715 states and 987 transitions. [2025-03-04 10:53:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2025-03-04 10:53:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,666 INFO L225 Difference]: With dead ends: 715 [2025-03-04 10:53:11,666 INFO L226 Difference]: Without dead ends: 694 [2025-03-04 10:53:11,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:11,667 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 20 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 393 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-04 10:53:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-04 10:53:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 545 states have (on average 1.6220183486238533) internal successors, (884), 651 states have internal predecessors, (884), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 964 transitions. [2025-03-04 10:53:11,689 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 964 transitions. Word has length 106 [2025-03-04 10:53:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 964 transitions. [2025-03-04 10:53:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 964 transitions. [2025-03-04 10:53:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 10:53:11,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,690 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:53:11,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:53:11,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1927118886, now seen corresponding path program 1 times [2025-03-04 10:53:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78823062] [2025-03-04 10:53:11,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 10:53:11,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:53:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149850992] [2025-03-04 10:53:11,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:11,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:11,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:53:11,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 10:53:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:53:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:11,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:12,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78823062] [2025-03-04 10:53:12,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149850992] [2025-03-04 10:53:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149850992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:12,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041215558] [2025-03-04 10:53:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:12,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:12,163 INFO L87 Difference]: Start difference. First operand 694 states and 964 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 10:53:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:12,565 INFO L93 Difference]: Finished difference Result 694 states and 964 transitions. [2025-03-04 10:53:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:12,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 124 [2025-03-04 10:53:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:12,572 INFO L225 Difference]: With dead ends: 694 [2025-03-04 10:53:12,572 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 10:53:12,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:12,576 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 136 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:12,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 280 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 10:53:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-04 10:53:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 545 states have (on average 1.5669724770642202) internal successors, (854), 641 states have internal predecessors, (854), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 934 transitions. [2025-03-04 10:53:12,596 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 934 transitions. Word has length 124 [2025-03-04 10:53:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:12,596 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 934 transitions. [2025-03-04 10:53:12,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 10:53:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 934 transitions. [2025-03-04 10:53:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 10:53:12,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:12,597 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:12,603 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 10:53:12,798 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,SelfDestructingSolverStorable21 [2025-03-04 10:53:12,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -388856459, now seen corresponding path program 1 times [2025-03-04 10:53:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580322018] [2025-03-04 10:53:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:12,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:53:12,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:53:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934923982] [2025-03-04 10:53:12,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:12,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:12,818 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:12,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:53:12,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:53:12,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:53:12,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:12,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:13,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580322018] [2025-03-04 10:53:13,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934923982] [2025-03-04 10:53:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934923982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:13,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:13,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166607004] [2025-03-04 10:53:13,479 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:13,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:13,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:13,480 INFO L87 Difference]: Start difference. First operand 684 states and 934 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 10:53:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,909 INFO L93 Difference]: Finished difference Result 737 states and 962 transitions. [2025-03-04 10:53:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 125 [2025-03-04 10:53:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,912 INFO L225 Difference]: With dead ends: 737 [2025-03-04 10:53:13,912 INFO L226 Difference]: Without dead ends: 714 [2025-03-04 10:53:13,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:13,913 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 131 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 378 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-04 10:53:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 696. [2025-03-04 10:53:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 557 states have (on average 1.5296229802513466) internal successors, (852), 652 states have internal predecessors, (852), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 932 transitions. [2025-03-04 10:53:13,930 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 932 transitions. Word has length 125 [2025-03-04 10:53:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,930 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 932 transitions. [2025-03-04 10:53:13,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 10:53:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 932 transitions. [2025-03-04 10:53:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 10:53:13,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,933 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:53:14,133 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,SelfDestructingSolverStorable22 [2025-03-04 10:53:14,134 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:14,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 830351876, now seen corresponding path program 1 times [2025-03-04 10:53:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053751454] [2025-03-04 10:53:14,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 10:53:14,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:14,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053751454] [2025-03-04 10:53:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053751454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523747262] [2025-03-04 10:53:14,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:14,217 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:53:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 10:53:14,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:14,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:14,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523747262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:14,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043730739] [2025-03-04 10:53:14,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:14,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:14,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:14,545 INFO L87 Difference]: Start difference. First operand 696 states and 932 transitions. Second operand has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:14,902 INFO L93 Difference]: Finished difference Result 740 states and 939 transitions. [2025-03-04 10:53:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 126 [2025-03-04 10:53:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:14,905 INFO L225 Difference]: With dead ends: 740 [2025-03-04 10:53:14,905 INFO L226 Difference]: Without dead ends: 735 [2025-03-04 10:53:14,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:14,905 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 470 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:14,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 518 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-04 10:53:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 695. [2025-03-04 10:53:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 557 states have (on average 1.5080789946140036) internal successors, (840), 651 states have internal predecessors, (840), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 920 transitions. [2025-03-04 10:53:14,920 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 920 transitions. Word has length 126 [2025-03-04 10:53:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 920 transitions. [2025-03-04 10:53:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 920 transitions. [2025-03-04 10:53:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 10:53:14,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:14,921 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:14,927 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 10:53:15,121 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,SelfDestructingSolverStorable23 [2025-03-04 10:53:15,122 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -28895405, now seen corresponding path program 1 times [2025-03-04 10:53:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195179690] [2025-03-04 10:53:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:15,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:15,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195179690] [2025-03-04 10:53:15,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195179690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006675375] [2025-03-04 10:53:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:15,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:15,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:53:15,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:15,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:15,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:15,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006675375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:15,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133549969] [2025-03-04 10:53:15,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:15,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:15,530 INFO L87 Difference]: Start difference. First operand 695 states and 920 transitions. Second operand has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:15,958 INFO L93 Difference]: Finished difference Result 739 states and 927 transitions. [2025-03-04 10:53:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 127 [2025-03-04 10:53:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:15,961 INFO L225 Difference]: With dead ends: 739 [2025-03-04 10:53:15,961 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 10:53:15,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:15,963 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 334 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:15,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 571 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 10:53:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 694. [2025-03-04 10:53:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 557 states have (on average 1.4865350089766607) internal successors, (828), 650 states have internal predecessors, (828), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 908 transitions. [2025-03-04 10:53:15,991 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 908 transitions. Word has length 127 [2025-03-04 10:53:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 908 transitions. [2025-03-04 10:53:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 908 transitions. [2025-03-04 10:53:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 10:53:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:15,994 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:16,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:53:16,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:16,195 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:16,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -895757342, now seen corresponding path program 1 times [2025-03-04 10:53:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590422824] [2025-03-04 10:53:16,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:16,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 10:53:16,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:53:16,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364402848] [2025-03-04 10:53:16,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:16,213 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:16,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:53:16,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 10:53:16,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:53:16,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:16,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:53:16,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:16,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590422824] [2025-03-04 10:53:16,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364402848] [2025-03-04 10:53:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364402848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:16,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:53:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201870720] [2025-03-04 10:53:16,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:16,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:53:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:16,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:53:16,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:16,774 INFO L87 Difference]: Start difference. First operand 694 states and 908 transitions. Second operand has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:18,402 INFO L93 Difference]: Finished difference Result 759 states and 940 transitions. [2025-03-04 10:53:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:53:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2025-03-04 10:53:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:18,404 INFO L225 Difference]: With dead ends: 759 [2025-03-04 10:53:18,404 INFO L226 Difference]: Without dead ends: 664 [2025-03-04 10:53:18,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:18,405 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 406 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:18,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 510 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 10:53:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-04 10:53:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 641. [2025-03-04 10:53:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 509 states have (on average 1.4538310412573674) internal successors, (740), 600 states have internal predecessors, (740), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 814 transitions. [2025-03-04 10:53:18,426 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 814 transitions. Word has length 128 [2025-03-04 10:53:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:18,426 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 814 transitions. [2025-03-04 10:53:18,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 814 transitions. [2025-03-04 10:53:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 10:53:18,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:18,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:53:18,434 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 10:53:18,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:53:18,629 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:18,630 INFO L85 PathProgramCache]: Analyzing trace with hash -190293075, now seen corresponding path program 1 times [2025-03-04 10:53:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:18,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858396313] [2025-03-04 10:53:18,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 10:53:18,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 10:53:18,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-04 10:53:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858396313] [2025-03-04 10:53:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858396313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:18,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639953744] [2025-03-04 10:53:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:18,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:18,673 INFO L87 Difference]: Start difference. First operand 641 states and 814 transitions. Second operand has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:18,888 INFO L93 Difference]: Finished difference Result 647 states and 814 transitions. [2025-03-04 10:53:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 170 [2025-03-04 10:53:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:18,890 INFO L225 Difference]: With dead ends: 647 [2025-03-04 10:53:18,890 INFO L226 Difference]: Without dead ends: 644 [2025-03-04 10:53:18,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:18,890 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 134 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:18,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 192 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-04 10:53:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 639. [2025-03-04 10:53:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 509 states have (on average 1.4420432220039292) internal successors, (734), 598 states have internal predecessors, (734), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 808 transitions. [2025-03-04 10:53:18,905 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 808 transitions. Word has length 170 [2025-03-04 10:53:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:18,905 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 808 transitions. [2025-03-04 10:53:18,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 808 transitions. [2025-03-04 10:53:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 10:53:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:18,906 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:53:18,906 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1348048934, now seen corresponding path program 1 times [2025-03-04 10:53:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606444761] [2025-03-04 10:53:18,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:18,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 10:53:18,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 10:53:18,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606444761] [2025-03-04 10:53:18,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606444761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783648111] [2025-03-04 10:53:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:18,977 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:18,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:53:19,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 10:53:19,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 10:53:19,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:19,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:19,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:19,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:19,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783648111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:19,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:53:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587175308] [2025-03-04 10:53:19,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:19,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:19,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:19,288 INFO L87 Difference]: Start difference. First operand 639 states and 808 transitions. Second operand has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:19,578 INFO L93 Difference]: Finished difference Result 724 states and 832 transitions. [2025-03-04 10:53:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 173 [2025-03-04 10:53:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:19,580 INFO L225 Difference]: With dead ends: 724 [2025-03-04 10:53:19,580 INFO L226 Difference]: Without dead ends: 722 [2025-03-04 10:53:19,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:19,580 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 925 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:19,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 763 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-04 10:53:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 637. [2025-03-04 10:53:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 509 states have (on average 1.4263261296660117) internal successors, (726), 596 states have internal predecessors, (726), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 800 transitions. [2025-03-04 10:53:19,596 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 800 transitions. Word has length 173 [2025-03-04 10:53:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:19,597 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 800 transitions. [2025-03-04 10:53:19,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 800 transitions. [2025-03-04 10:53:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 10:53:19,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:19,598 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:19,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:53:19,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:53:19,798 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1160156138, now seen corresponding path program 1 times [2025-03-04 10:53:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130892244] [2025-03-04 10:53:19,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:19,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:53:19,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:53:19,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:19,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165377310] [2025-03-04 10:53:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:19,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:19,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:19,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:53:19,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:53:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:53:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:19,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:19,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:20,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130892244] [2025-03-04 10:53:20,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165377310] [2025-03-04 10:53:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165377310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:20,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:20,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873812181] [2025-03-04 10:53:20,817 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:20,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:20,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:20,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:20,818 INFO L87 Difference]: Start difference. First operand 637 states and 800 transitions. Second operand has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:21,233 INFO L93 Difference]: Finished difference Result 638 states and 800 transitions. [2025-03-04 10:53:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:21,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 174 [2025-03-04 10:53:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:21,235 INFO L225 Difference]: With dead ends: 638 [2025-03-04 10:53:21,235 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 10:53:21,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:21,235 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 32 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 466 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 10:53:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-03-04 10:53:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 509 states have (on average 1.424361493123772) internal successors, (725), 596 states have internal predecessors, (725), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 799 transitions. [2025-03-04 10:53:21,250 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 799 transitions. Word has length 174 [2025-03-04 10:53:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 799 transitions. [2025-03-04 10:53:21,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 799 transitions. [2025-03-04 10:53:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 10:53:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:21,251 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:21,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:53:21,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:53:21,455 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1605102040, now seen corresponding path program 1 times [2025-03-04 10:53:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708672585] [2025-03-04 10:53:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 10:53:21,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 10:53:21,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:21,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157236793] [2025-03-04 10:53:21,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:21,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:21,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:21,477 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:53:21,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 10:53:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 10:53:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:21,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:21,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:21,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:21,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:21,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708672585] [2025-03-04 10:53:21,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:21,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157236793] [2025-03-04 10:53:21,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157236793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:21,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278031540] [2025-03-04 10:53:21,957 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:21,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:21,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:21,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:21,957 INFO L87 Difference]: Start difference. First operand 637 states and 799 transitions. Second operand has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:22,358 INFO L93 Difference]: Finished difference Result 648 states and 799 transitions. [2025-03-04 10:53:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:22,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 175 [2025-03-04 10:53:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:22,360 INFO L225 Difference]: With dead ends: 648 [2025-03-04 10:53:22,360 INFO L226 Difference]: Without dead ends: 647 [2025-03-04 10:53:22,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:22,361 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 69 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:22,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 560 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-04 10:53:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 637. [2025-03-04 10:53:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 509 states have (on average 1.4223968565815324) internal successors, (724), 596 states have internal predecessors, (724), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 798 transitions. [2025-03-04 10:53:22,378 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 798 transitions. Word has length 175 [2025-03-04 10:53:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 798 transitions. [2025-03-04 10:53:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 798 transitions. [2025-03-04 10:53:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 10:53:22,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:22,380 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:22,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:22,583 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:22,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1724094310, now seen corresponding path program 1 times [2025-03-04 10:53:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197355935] [2025-03-04 10:53:22,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:22,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 10:53:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 10:53:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:22,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323373146] [2025-03-04 10:53:22,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:22,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:22,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:22,601 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:22,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:53:22,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 10:53:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 10:53:22,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:22,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:22,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:53:22,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:23,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197355935] [2025-03-04 10:53:24,028 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323373146] [2025-03-04 10:53:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323373146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:24,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:53:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937681705] [2025-03-04 10:53:24,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:53:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:24,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:53:24,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:24,029 INFO L87 Difference]: Start difference. First operand 637 states and 798 transitions. Second operand has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:26,211 INFO L93 Difference]: Finished difference Result 661 states and 822 transitions. [2025-03-04 10:53:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 178 [2025-03-04 10:53:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:26,213 INFO L225 Difference]: With dead ends: 661 [2025-03-04 10:53:26,213 INFO L226 Difference]: Without dead ends: 653 [2025-03-04 10:53:26,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:26,214 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 324 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:26,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 367 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 10:53:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-04 10:53:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 637. [2025-03-04 10:53:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 509 states have (on average 1.4066797642436148) internal successors, (716), 596 states have internal predecessors, (716), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:53:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 790 transitions. [2025-03-04 10:53:26,230 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 790 transitions. Word has length 178 [2025-03-04 10:53:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:26,231 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 790 transitions. [2025-03-04 10:53:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 790 transitions. [2025-03-04 10:53:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 10:53:26,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:26,231 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:26,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:26,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:26,433 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -407721105, now seen corresponding path program 1 times [2025-03-04 10:53:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293406667] [2025-03-04 10:53:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 10:53:26,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 10:53:26,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796023807] [2025-03-04 10:53:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:26,461 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:26,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:53:26,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 10:53:26,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 10:53:26,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:26,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:26,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:53:26,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 10:53:27,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293406667] [2025-03-04 10:53:27,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796023807] [2025-03-04 10:53:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796023807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:27,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:53:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768486013] [2025-03-04 10:53:27,136 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:27,137 INFO L87 Difference]: Start difference. First operand 637 states and 790 transitions. Second operand has 9 states, 8 states have (on average 17.875) internal successors, (143), 9 states have internal predecessors, (143), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:53:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:27,851 INFO L93 Difference]: Finished difference Result 647 states and 794 transitions. [2025-03-04 10:53:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.875) internal successors, (143), 9 states have internal predecessors, (143), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 197 [2025-03-04 10:53:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:27,853 INFO L225 Difference]: With dead ends: 647 [2025-03-04 10:53:27,853 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 10:53:27,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:27,855 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 28 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:27,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 910 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:53:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 10:53:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-03-04 10:53:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 477 states have (on average 1.421383647798742) internal successors, (678), 564 states have internal predecessors, (678), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 10:53:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 748 transitions. [2025-03-04 10:53:27,874 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 748 transitions. Word has length 197 [2025-03-04 10:53:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:27,874 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 748 transitions. [2025-03-04 10:53:27,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.875) internal successors, (143), 9 states have internal predecessors, (143), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:53:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 748 transitions. [2025-03-04 10:53:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:53:27,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:27,875 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:27,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:53:28,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 10:53:28,076 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 464769543, now seen corresponding path program 1 times [2025-03-04 10:53:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615591238] [2025-03-04 10:53:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:28,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 10:53:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:28,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371546787] [2025-03-04 10:53:28,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:28,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:28,098 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:28,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:53:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 10:53:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:28,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:28,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:28,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615591238] [2025-03-04 10:53:28,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371546787] [2025-03-04 10:53:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371546787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:28,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646243828] [2025-03-04 10:53:28,344 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:28,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:28,345 INFO L87 Difference]: Start difference. First operand 603 states and 748 transitions. Second operand has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:28,444 INFO L93 Difference]: Finished difference Result 694 states and 772 transitions. [2025-03-04 10:53:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:28,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 202 [2025-03-04 10:53:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:28,446 INFO L225 Difference]: With dead ends: 694 [2025-03-04 10:53:28,446 INFO L226 Difference]: Without dead ends: 693 [2025-03-04 10:53:28,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:28,447 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 189 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:28,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 709 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-04 10:53:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 603. [2025-03-04 10:53:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 477 states have (on average 1.419287211740042) internal successors, (677), 564 states have internal predecessors, (677), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 10:53:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 747 transitions. [2025-03-04 10:53:28,462 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 747 transitions. Word has length 202 [2025-03-04 10:53:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 747 transitions. [2025-03-04 10:53:28,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 5 states have internal predecessors, (145), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 747 transitions. [2025-03-04 10:53:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 10:53:28,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:28,464 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:28,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:53:28,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:53:28,664 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1351941391, now seen corresponding path program 2 times [2025-03-04 10:53:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521753421] [2025-03-04 10:53:28,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:28,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 209 statements into 2 equivalence classes. [2025-03-04 10:53:28,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 10:53:28,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:28,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:28,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177430014] [2025-03-04 10:53:28,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:28,695 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:28,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:53:28,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 209 statements into 2 equivalence classes. [2025-03-04 10:53:28,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 10:53:28,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:28,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:53:28,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:29,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521753421] [2025-03-04 10:53:29,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177430014] [2025-03-04 10:53:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177430014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:29,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:53:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11800903] [2025-03-04 10:53:29,640 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:29,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:29,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:29,641 INFO L87 Difference]: Start difference. First operand 603 states and 747 transitions. Second operand has 9 states, 8 states have (on average 18.375) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:30,381 INFO L93 Difference]: Finished difference Result 645 states and 771 transitions. [2025-03-04 10:53:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:30,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.375) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 209 [2025-03-04 10:53:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:30,383 INFO L225 Difference]: With dead ends: 645 [2025-03-04 10:53:30,383 INFO L226 Difference]: Without dead ends: 623 [2025-03-04 10:53:30,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:30,383 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 121 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:30,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 496 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:53:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-04 10:53:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 611. [2025-03-04 10:53:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 485 states have (on average 1.3731958762886598) internal successors, (666), 571 states have internal predecessors, (666), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 10:53:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 736 transitions. [2025-03-04 10:53:30,398 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 736 transitions. Word has length 209 [2025-03-04 10:53:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:30,398 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 736 transitions. [2025-03-04 10:53:30,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.375) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 736 transitions. [2025-03-04 10:53:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 10:53:30,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:30,399 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:30,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:30,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:30,600 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:30,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1039489622, now seen corresponding path program 2 times [2025-03-04 10:53:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:30,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644003406] [2025-03-04 10:53:30,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:30,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-03-04 10:53:30,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 10:53:30,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:30,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644003406] [2025-03-04 10:53:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644003406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171721077] [2025-03-04 10:53:30,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:30,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:30,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:30,740 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:30,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:53:30,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-03-04 10:53:30,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 10:53:30,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:30,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:30,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:31,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171721077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:31,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:53:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575843001] [2025-03-04 10:53:31,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:53:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:31,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:53:31,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:31,284 INFO L87 Difference]: Start difference. First operand 611 states and 736 transitions. Second operand has 13 states, 12 states have (on average 33.916666666666664) internal successors, (407), 13 states have internal predecessors, (407), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:32,270 INFO L93 Difference]: Finished difference Result 611 states and 736 transitions. [2025-03-04 10:53:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:32,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 33.916666666666664) internal successors, (407), 13 states have internal predecessors, (407), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 210 [2025-03-04 10:53:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:32,272 INFO L225 Difference]: With dead ends: 611 [2025-03-04 10:53:32,272 INFO L226 Difference]: Without dead ends: 604 [2025-03-04 10:53:32,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:53:32,273 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 373 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:32,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 660 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-04 10:53:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-04 10:53:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 485 states have (on average 1.3463917525773197) internal successors, (653), 564 states have internal predecessors, (653), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 10:53:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 723 transitions. [2025-03-04 10:53:32,298 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 723 transitions. Word has length 210 [2025-03-04 10:53:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:32,299 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 723 transitions. [2025-03-04 10:53:32,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 33.916666666666664) internal successors, (407), 13 states have internal predecessors, (407), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 723 transitions. [2025-03-04 10:53:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-04 10:53:32,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:32,300 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:32,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:32,500 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:32,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2135560301, now seen corresponding path program 2 times [2025-03-04 10:53:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869980413] [2025-03-04 10:53:32,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:32,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-03-04 10:53:32,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-04 10:53:32,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:32,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869980413] [2025-03-04 10:53:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869980413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107768694] [2025-03-04 10:53:32,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:32,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:32,615 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:32,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:53:32,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 211 statements into 2 equivalence classes. [2025-03-04 10:53:32,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-04 10:53:32,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:32,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:32,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107768694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:33,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:53:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813689385] [2025-03-04 10:53:33,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:33,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:53:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:33,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:53:33,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:33,187 INFO L87 Difference]: Start difference. First operand 604 states and 723 transitions. Second operand has 13 states, 12 states have (on average 34.083333333333336) internal successors, (409), 13 states have internal predecessors, (409), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:33,829 INFO L93 Difference]: Finished difference Result 672 states and 768 transitions. [2025-03-04 10:53:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:33,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 34.083333333333336) internal successors, (409), 13 states have internal predecessors, (409), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 211 [2025-03-04 10:53:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:33,832 INFO L225 Difference]: With dead ends: 672 [2025-03-04 10:53:33,832 INFO L226 Difference]: Without dead ends: 670 [2025-03-04 10:53:33,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:53:33,832 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 517 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:33,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 764 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:53:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-04 10:53:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 629. [2025-03-04 10:53:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 507 states have (on average 1.3333333333333333) internal successors, (676), 586 states have internal predecessors, (676), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 10:53:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 752 transitions. [2025-03-04 10:53:33,849 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 752 transitions. Word has length 211 [2025-03-04 10:53:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:33,849 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 752 transitions. [2025-03-04 10:53:33,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 34.083333333333336) internal successors, (409), 13 states have internal predecessors, (409), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 752 transitions. [2025-03-04 10:53:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 10:53:33,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:33,851 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:33,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:53:34,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:53:34,055 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -720911413, now seen corresponding path program 1 times [2025-03-04 10:53:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674266648] [2025-03-04 10:53:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 10:53:34,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 10:53:34,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:34,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674266648] [2025-03-04 10:53:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674266648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131308592] [2025-03-04 10:53:34,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:34,188 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:34,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:53:34,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 10:53:34,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 10:53:34,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:34,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:34,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131308592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:34,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 10:53:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838953831] [2025-03-04 10:53:34,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:34,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:34,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:34,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:34,661 INFO L87 Difference]: Start difference. First operand 629 states and 752 transitions. Second operand has 11 states, 10 states have (on average 27.1) internal successors, (271), 11 states have internal predecessors, (271), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2025-03-04 10:53:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:36,923 INFO L93 Difference]: Finished difference Result 636 states and 755 transitions. [2025-03-04 10:53:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 27.1) internal successors, (271), 11 states have internal predecessors, (271), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 213 [2025-03-04 10:53:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:36,925 INFO L225 Difference]: With dead ends: 636 [2025-03-04 10:53:36,926 INFO L226 Difference]: Without dead ends: 624 [2025-03-04 10:53:36,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:53:36,926 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 899 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 702 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 10:53:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-04 10:53:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-03-04 10:53:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 509 states have (on average 1.3045186640471513) internal successors, (664), 580 states have internal predecessors, (664), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 10:53:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 740 transitions. [2025-03-04 10:53:36,940 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 740 transitions. Word has length 213 [2025-03-04 10:53:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:36,940 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 740 transitions. [2025-03-04 10:53:36,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 27.1) internal successors, (271), 11 states have internal predecessors, (271), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2025-03-04 10:53:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 740 transitions. [2025-03-04 10:53:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 10:53:36,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:36,941 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:53:36,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:37,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:53:37,141 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1835217212, now seen corresponding path program 1 times [2025-03-04 10:53:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741026994] [2025-03-04 10:53:37,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:37,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:37,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 10:53:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 10:53:37,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:37,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863521205] [2025-03-04 10:53:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:37,164 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:37,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:53:37,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 10:53:37,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 10:53:37,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:37,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:53:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:37,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741026994] [2025-03-04 10:53:38,041 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863521205] [2025-03-04 10:53:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863521205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:38,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:38,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:53:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869215825] [2025-03-04 10:53:38,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:38,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:53:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:38,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:53:38,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:38,042 INFO L87 Difference]: Start difference. First operand 624 states and 740 transitions. Second operand has 16 states, 15 states have (on average 20.266666666666666) internal successors, (304), 16 states have internal predecessors, (304), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:41,372 INFO L93 Difference]: Finished difference Result 1020 states and 1295 transitions. [2025-03-04 10:53:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:53:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 20.266666666666666) internal successors, (304), 16 states have internal predecessors, (304), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 216 [2025-03-04 10:53:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:41,375 INFO L225 Difference]: With dead ends: 1020 [2025-03-04 10:53:41,375 INFO L226 Difference]: Without dead ends: 936 [2025-03-04 10:53:41,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:53:41,376 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1330 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:41,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1097 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 10:53:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-04 10:53:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 728. [2025-03-04 10:53:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 606 states have (on average 1.3283828382838283) internal successors, (805), 677 states have internal predecessors, (805), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 10:53:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 895 transitions. [2025-03-04 10:53:41,397 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 895 transitions. Word has length 216 [2025-03-04 10:53:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:41,397 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 895 transitions. [2025-03-04 10:53:41,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 20.266666666666666) internal successors, (304), 16 states have internal predecessors, (304), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 895 transitions. [2025-03-04 10:53:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-04 10:53:41,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:41,398 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:41,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:53:41,599 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:41,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -571806832, now seen corresponding path program 2 times [2025-03-04 10:53:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834968867] [2025-03-04 10:53:41,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:41,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-04 10:53:41,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 10:53:41,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:41,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147541923] [2025-03-04 10:53:41,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:41,623 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:41,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:53:41,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-04 10:53:41,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 10:53:41,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:41,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:41,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:42,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834968867] [2025-03-04 10:53:42,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147541923] [2025-03-04 10:53:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147541923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:42,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:53:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105873294] [2025-03-04 10:53:42,678 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:42,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:42,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:42,679 INFO L87 Difference]: Start difference. First operand 728 states and 895 transitions. Second operand has 8 states, 7 states have (on average 25.857142857142858) internal successors, (181), 8 states have internal predecessors, (181), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:43,520 INFO L93 Difference]: Finished difference Result 729 states and 895 transitions. [2025-03-04 10:53:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:53:43,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 25.857142857142858) internal successors, (181), 8 states have internal predecessors, (181), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 258 [2025-03-04 10:53:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:43,523 INFO L225 Difference]: With dead ends: 729 [2025-03-04 10:53:43,523 INFO L226 Difference]: Without dead ends: 725 [2025-03-04 10:53:43,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:53:43,524 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 659 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:43,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 190 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:53:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-04 10:53:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 724. [2025-03-04 10:53:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 606 states have (on average 1.3052805280528053) internal successors, (791), 673 states have internal predecessors, (791), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 10:53:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 881 transitions. [2025-03-04 10:53:43,543 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 881 transitions. Word has length 258 [2025-03-04 10:53:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:43,543 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 881 transitions. [2025-03-04 10:53:43,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 25.857142857142858) internal successors, (181), 8 states have internal predecessors, (181), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 881 transitions. [2025-03-04 10:53:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-04 10:53:43,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:43,544 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:43,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:53:43,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:53:43,745 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:43,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -546142478, now seen corresponding path program 2 times [2025-03-04 10:53:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617896631] [2025-03-04 10:53:43,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:43,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 259 statements into 2 equivalence classes. [2025-03-04 10:53:43,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 10:53:43,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:43,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288155493] [2025-03-04 10:53:43,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:43,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:43,766 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:43,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:53:43,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 259 statements into 2 equivalence classes. [2025-03-04 10:53:43,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 259 of 259 statements. [2025-03-04 10:53:43,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:43,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:53:43,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:44,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617896631] [2025-03-04 10:53:44,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288155493] [2025-03-04 10:53:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288155493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:44,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:53:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218427535] [2025-03-04 10:53:44,556 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:44,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:53:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:44,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:53:44,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:44,557 INFO L87 Difference]: Start difference. First operand 724 states and 881 transitions. Second operand has 10 states, 9 states have (on average 20.22222222222222) internal successors, (182), 10 states have internal predecessors, (182), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:53:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:45,370 INFO L93 Difference]: Finished difference Result 733 states and 881 transitions. [2025-03-04 10:53:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:45,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 20.22222222222222) internal successors, (182), 10 states have internal predecessors, (182), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 259 [2025-03-04 10:53:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:45,373 INFO L225 Difference]: With dead ends: 733 [2025-03-04 10:53:45,373 INFO L226 Difference]: Without dead ends: 732 [2025-03-04 10:53:45,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:53:45,373 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 120 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:45,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 751 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:53:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-04 10:53:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 724. [2025-03-04 10:53:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 606 states have (on average 1.3036303630363035) internal successors, (790), 673 states have internal predecessors, (790), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 10:53:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 880 transitions. [2025-03-04 10:53:45,391 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 880 transitions. Word has length 259 [2025-03-04 10:53:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 880 transitions. [2025-03-04 10:53:45,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 20.22222222222222) internal successors, (182), 10 states have internal predecessors, (182), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:53:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 880 transitions. [2025-03-04 10:53:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-04 10:53:45,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:45,393 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:45,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:53:45,593 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -794317812, now seen corresponding path program 2 times [2025-03-04 10:53:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098878280] [2025-03-04 10:53:45,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:45,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 262 statements into 2 equivalence classes. [2025-03-04 10:53:45,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:53:45,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:45,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199303840] [2025-03-04 10:53:45,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:45,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:45,614 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:45,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:53:45,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 262 statements into 2 equivalence classes. [2025-03-04 10:53:45,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:53:45,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:45,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:53:45,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:46,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098878280] [2025-03-04 10:53:47,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199303840] [2025-03-04 10:53:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199303840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:47,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:53:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487676061] [2025-03-04 10:53:47,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:53:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:47,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:53:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:47,698 INFO L87 Difference]: Start difference. First operand 724 states and 880 transitions. Second operand has 16 states, 15 states have (on average 24.4) internal successors, (366), 16 states have internal predecessors, (366), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 10:53:52,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:55,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:59,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:54:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:02,655 INFO L93 Difference]: Finished difference Result 760 states and 914 transitions. [2025-03-04 10:54:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:02,655 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 24.4) internal successors, (366), 16 states have internal predecessors, (366), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 262 [2025-03-04 10:54:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:02,657 INFO L225 Difference]: With dead ends: 760 [2025-03-04 10:54:02,657 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 10:54:02,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:54:02,658 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 327 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:02,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 694 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2899 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2025-03-04 10:54:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 10:54:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 736. [2025-03-04 10:54:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 617 states have (on average 1.2917341977309562) internal successors, (797), 684 states have internal predecessors, (797), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:54:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 889 transitions. [2025-03-04 10:54:02,684 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 889 transitions. Word has length 262 [2025-03-04 10:54:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:02,684 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 889 transitions. [2025-03-04 10:54:02,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 24.4) internal successors, (366), 16 states have internal predecessors, (366), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 10:54:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 889 transitions. [2025-03-04 10:54:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 10:54:02,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:02,685 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:54:02,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:02,886 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash -663973011, now seen corresponding path program 1 times [2025-03-04 10:54:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150323208] [2025-03-04 10:54:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:02,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 10:54:02,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:54:02,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430205554] [2025-03-04 10:54:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:02,906 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:02,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:54:02,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 10:54:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:54:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:02,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:02,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:03,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150323208] [2025-03-04 10:54:03,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430205554] [2025-03-04 10:54:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430205554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:03,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:54:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631944721] [2025-03-04 10:54:03,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:03,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:03,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:03,407 INFO L87 Difference]: Start difference. First operand 736 states and 889 transitions. Second operand has 10 states, 9 states have (on average 43.55555555555556) internal successors, (392), 10 states have internal predecessors, (392), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:03,652 INFO L93 Difference]: Finished difference Result 929 states and 1016 transitions. [2025-03-04 10:54:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 43.55555555555556) internal successors, (392), 10 states have internal predecessors, (392), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 275 [2025-03-04 10:54:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:03,655 INFO L225 Difference]: With dead ends: 929 [2025-03-04 10:54:03,655 INFO L226 Difference]: Without dead ends: 927 [2025-03-04 10:54:03,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:03,655 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1340 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:03,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2160 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-04 10:54:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 735. [2025-03-04 10:54:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 617 states have (on average 1.2852512155591571) internal successors, (793), 683 states have internal predecessors, (793), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:54:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 885 transitions. [2025-03-04 10:54:03,678 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 885 transitions. Word has length 275 [2025-03-04 10:54:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 885 transitions. [2025-03-04 10:54:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 43.55555555555556) internal successors, (392), 10 states have internal predecessors, (392), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 885 transitions. [2025-03-04 10:54:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-04 10:54:03,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:03,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:03,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:54:03,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 10:54:03,880 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1560340215, now seen corresponding path program 2 times [2025-03-04 10:54:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:03,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752583803] [2025-03-04 10:54:03,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:03,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-03-04 10:54:03,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 281 of 281 statements. [2025-03-04 10:54:03,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:03,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690203892] [2025-03-04 10:54:03,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:03,907 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:03,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:54:03,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-03-04 10:54:03,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 281 of 281 statements. [2025-03-04 10:54:03,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:03,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:03,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:54:03,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:04,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:05,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752583803] [2025-03-04 10:54:05,065 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:05,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690203892] [2025-03-04 10:54:05,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690203892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:05,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:05,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 10:54:05,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609529900] [2025-03-04 10:54:05,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:05,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:54:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:05,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:54:05,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:54:05,066 INFO L87 Difference]: Start difference. First operand 735 states and 885 transitions. Second operand has 20 states, 19 states have (on average 20.736842105263158) internal successors, (394), 20 states have internal predecessors, (394), 8 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 10:54:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,923 INFO L93 Difference]: Finished difference Result 870 states and 1077 transitions. [2025-03-04 10:54:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:54:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 20.736842105263158) internal successors, (394), 20 states have internal predecessors, (394), 8 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 281 [2025-03-04 10:54:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,926 INFO L225 Difference]: With dead ends: 870 [2025-03-04 10:54:07,926 INFO L226 Difference]: Without dead ends: 830 [2025-03-04 10:54:07,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:54:07,927 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 732 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 4780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 756 Invalid, 4780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 10:54:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-04 10:54:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 750. [2025-03-04 10:54:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 630 states have (on average 1.3031746031746032) internal successors, (821), 696 states have internal predecessors, (821), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:54:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 917 transitions. [2025-03-04 10:54:07,951 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 917 transitions. Word has length 281 [2025-03-04 10:54:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 917 transitions. [2025-03-04 10:54:07,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 20.736842105263158) internal successors, (394), 20 states have internal predecessors, (394), 8 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 10:54:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 917 transitions. [2025-03-04 10:54:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 10:54:07,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,952 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:54:07,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:54:08,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,153 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1099443287, now seen corresponding path program 3 times [2025-03-04 10:54:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092508955] [2025-03-04 10:54:08,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:08,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 8 equivalence classes. [2025-03-04 10:54:08,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 10:54:08,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:54:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263411153] [2025-03-04 10:54:08,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:08,183 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:08,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:54:08,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 8 equivalence classes. [2025-03-04 10:54:08,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 102 of 293 statements. [2025-03-04 10:54:08,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:54:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:54:08,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 146 proven. 106 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-04 10:54:09,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092508955] [2025-03-04 10:54:11,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263411153] [2025-03-04 10:54:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263411153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:11,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:54:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997334261] [2025-03-04 10:54:11,455 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:54:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:11,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:54:11,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:54:11,456 INFO L87 Difference]: Start difference. First operand 750 states and 917 transitions. Second operand has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:54:19,317 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 40 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 10:54:21,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:54:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:25,805 INFO L93 Difference]: Finished difference Result 760 states and 927 transitions. [2025-03-04 10:54:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 293 [2025-03-04 10:54:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:25,808 INFO L225 Difference]: With dead ends: 760 [2025-03-04 10:54:25,808 INFO L226 Difference]: Without dead ends: 733 [2025-03-04 10:54:25,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:54:25,808 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 828 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:25,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 183 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-04 10:54:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-04 10:54:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 721. [2025-03-04 10:54:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 628 states have (on average 1.1878980891719746) internal successors, (746), 668 states have internal predecessors, (746), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:54:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 842 transitions. [2025-03-04 10:54:25,837 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 842 transitions. Word has length 293 [2025-03-04 10:54:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:25,838 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 842 transitions. [2025-03-04 10:54:25,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:54:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 842 transitions. [2025-03-04 10:54:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-04 10:54:25,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:25,839 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:54:25,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:26,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:26,043 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:26,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:26,043 INFO L85 PathProgramCache]: Analyzing trace with hash -660077402, now seen corresponding path program 1 times [2025-03-04 10:54:26,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:26,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596519075] [2025-03-04 10:54:26,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:26,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 10:54:26,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 10:54:26,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:54:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596519075] [2025-03-04 10:54:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596519075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346415548] [2025-03-04 10:54:26,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:26,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:26,233 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:54:26,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 10:54:26,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 10:54:26,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:26,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:26,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:54:26,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:54:26,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346415548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-03-04 10:54:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799111645] [2025-03-04 10:54:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:26,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:26,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:26,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:26,530 INFO L87 Difference]: Start difference. First operand 721 states and 842 transitions. Second operand has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 7 states have internal predecessors, (217), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 10:54:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:27,083 INFO L93 Difference]: Finished difference Result 730 states and 851 transitions. [2025-03-04 10:54:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 7 states have internal predecessors, (217), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 304 [2025-03-04 10:54:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:27,085 INFO L225 Difference]: With dead ends: 730 [2025-03-04 10:54:27,085 INFO L226 Difference]: Without dead ends: 726 [2025-03-04 10:54:27,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:27,085 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 317 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 495 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:54:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-04 10:54:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 717. [2025-03-04 10:54:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 628 states have (on average 1.1751592356687899) internal successors, (738), 664 states have internal predecessors, (738), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:54:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 834 transitions. [2025-03-04 10:54:27,125 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 834 transitions. Word has length 304 [2025-03-04 10:54:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 834 transitions. [2025-03-04 10:54:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 7 states have internal predecessors, (217), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 10:54:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 834 transitions. [2025-03-04 10:54:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 10:54:27,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:27,126 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:54:27,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:27,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-04 10:54:27,327 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:27,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1012437213, now seen corresponding path program 1 times [2025-03-04 10:54:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:27,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727261894] [2025-03-04 10:54:27,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 10:54:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 10:54:27,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:27,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:54:27,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727261894] [2025-03-04 10:54:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727261894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966381482] [2025-03-04 10:54:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:27,604 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:27,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:54:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 10:54:27,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 10:54:27,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:27,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:27,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:54:27,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 192 proven. 117 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:54:28,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966381482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:30,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2025-03-04 10:54:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598753282] [2025-03-04 10:54:30,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:54:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:54:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:54:30,009 INFO L87 Difference]: Start difference. First operand 717 states and 834 transitions. Second operand has 25 states, 24 states have (on average 18.0) internal successors, (432), 25 states have internal predecessors, (432), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:54:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:33,451 INFO L93 Difference]: Finished difference Result 717 states and 834 transitions. [2025-03-04 10:54:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 18.0) internal successors, (432), 25 states have internal predecessors, (432), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 305 [2025-03-04 10:54:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:33,453 INFO L225 Difference]: With dead ends: 717 [2025-03-04 10:54:33,453 INFO L226 Difference]: Without dead ends: 669 [2025-03-04 10:54:33,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:54:33,454 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1166 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 3469 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 3567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:33,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1972 Invalid, 3567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3469 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 10:54:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-04 10:54:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 651. [2025-03-04 10:54:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 570 states have (on average 1.1578947368421053) internal successors, (660), 601 states have internal predecessors, (660), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 10:54:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 748 transitions. [2025-03-04 10:54:33,483 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 748 transitions. Word has length 305 [2025-03-04 10:54:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:33,484 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 748 transitions. [2025-03-04 10:54:33,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 18.0) internal successors, (432), 25 states have internal predecessors, (432), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:54:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 748 transitions. [2025-03-04 10:54:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 10:54:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:33,485 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:54:33,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-04 10:54:33,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-04 10:54:33,686 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:33,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 634397245, now seen corresponding path program 1 times [2025-03-04 10:54:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051351305] [2025-03-04 10:54:33,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:33,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-04 10:54:33,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-04 10:54:33,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:33,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2025-03-04 10:54:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051351305] [2025-03-04 10:54:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051351305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520267349] [2025-03-04 10:54:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:33,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:33,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:33,747 INFO L87 Difference]: Start difference. First operand 651 states and 748 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:34,003 INFO L93 Difference]: Finished difference Result 678 states and 776 transitions. [2025-03-04 10:54:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 334 [2025-03-04 10:54:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:34,005 INFO L225 Difference]: With dead ends: 678 [2025-03-04 10:54:34,005 INFO L226 Difference]: Without dead ends: 677 [2025-03-04 10:54:34,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:34,006 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 239 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:34,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 309 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-04 10:54:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 650. [2025-03-04 10:54:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 570 states have (on average 1.1543859649122807) internal successors, (658), 600 states have internal predecessors, (658), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 10:54:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 746 transitions. [2025-03-04 10:54:34,033 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 746 transitions. Word has length 334 [2025-03-04 10:54:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:34,033 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 746 transitions. [2025-03-04 10:54:34,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 746 transitions. [2025-03-04 10:54:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-04 10:54:34,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:34,034 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:34,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 10:54:34,034 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:34,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1029948172, now seen corresponding path program 3 times [2025-03-04 10:54:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171808347] [2025-03-04 10:54:34,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:34,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 343 statements into 8 equivalence classes. [2025-03-04 10:54:34,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 343 of 343 statements. [2025-03-04 10:54:34,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:54:34,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619791798] [2025-03-04 10:54:34,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:34,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:34,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:34,111 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:34,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:54:34,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 343 statements into 8 equivalence classes. [2025-03-04 10:54:34,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 188 of 343 statements. [2025-03-04 10:54:34,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:54:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:34,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:54:34,175 INFO L279 TraceCheckSpWp]: Computing forward predicates...