./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.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/hard2_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:11:47,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:11:47,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:11:47,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:11:47,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:11:47,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:11:47,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:11:47,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:11:47,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:11:47,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:11:47,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:11:47,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:11:47,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:11:47,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:11:47,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:11:47,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:11:47,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:11:47,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:11:47,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:11:47,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:11:47,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:11:47,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:11:47,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:11:47,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:11:47,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:11:47,876 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 -> 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 [2025-03-04 11:11:48,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:11:48,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:11:48,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:11:48,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:11:48,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:11:48,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2025-03-04 11:11:49,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e03d8e4/d6ea1fd5b9294e64950a3025690233fc/FLAG5351dd100 [2025-03-04 11:11:49,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:11:49,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2025-03-04 11:11:49,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e03d8e4/d6ea1fd5b9294e64950a3025690233fc/FLAG5351dd100 [2025-03-04 11:11:49,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e03d8e4/d6ea1fd5b9294e64950a3025690233fc [2025-03-04 11:11:49,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:11:49,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:11:49,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:11:49,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:11:49,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:11:49,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49, skipping insertion in model container [2025-03-04 11:11:49,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:11:49,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:11:49,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:11:49,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:11:49,567 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:11:49,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49 WrapperNode [2025-03-04 11:11:49,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:11:49,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:11:49,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:11:49,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:11:49,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,601 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2025-03-04 11:11:49,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:11:49,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:11:49,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:11:49,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:11:49,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,623 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-04 11:11:49,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:11:49,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:11:49,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:11:49,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:11:49,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (1/1) ... [2025-03-04 11:11:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:11:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:49,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:11:49,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:11:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:11:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:11:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:11:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:11:49,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:11:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:11:49,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:11:49,723 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:11:49,724 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:11:49,950 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 11:11:49,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:11:49,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:11:49,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:11:49,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:11:49 BoogieIcfgContainer [2025-03-04 11:11:49,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:11:49,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:11:49,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:11:49,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:11:49,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:11:49" (1/3) ... [2025-03-04 11:11:49,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289a367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:11:49, skipping insertion in model container [2025-03-04 11:11:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:11:49" (2/3) ... [2025-03-04 11:11:49,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289a367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:11:49, skipping insertion in model container [2025-03-04 11:11:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:11:49" (3/3) ... [2025-03-04 11:11:49,969 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.c [2025-03-04 11:11:49,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:11:49,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_unwindbound2.c that has 2 procedures, 82 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-03-04 11:11:50,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:11:50,026 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;@7950505a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:11:50,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 11:11:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 45 states have (on average 1.8) internal successors, (81), 73 states have internal predecessors, (81), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:11:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:11:50,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:50,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:11:50,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 3415967, now seen corresponding path program 1 times [2025-03-04 11:11:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:50,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010668851] [2025-03-04 11:11:50,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:50,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:11:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:11:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:50,181 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 11:11:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010668851] [2025-03-04 11:11:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010668851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:50,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615567618] [2025-03-04 11:11:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:11:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:50,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:11:50,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:11:50,202 INFO L87 Difference]: Start difference. First operand has 82 states, 45 states have (on average 1.8) internal successors, (81), 73 states have internal predecessors, (81), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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 11:11:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:50,268 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2025-03-04 11:11:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:11:50,270 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 11:11:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:50,274 INFO L225 Difference]: With dead ends: 170 [2025-03-04 11:11:50,275 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 11:11:50,278 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 11:11:50,280 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 35 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:50,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 224 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 11:11:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-03-04 11:11:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:11:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-04 11:11:50,317 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 4 [2025-03-04 11:11:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:50,317 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-04 11:11:50,318 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 11:11:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-04 11:11:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:11:50,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:50,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:11:50,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:11:50,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:50,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 105895021, now seen corresponding path program 1 times [2025-03-04 11:11:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:50,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39345310] [2025-03-04 11:11:50,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:50,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:11:50,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:11:50,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:50,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:50,367 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 11:11:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:50,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39345310] [2025-03-04 11:11:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39345310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:50,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432990123] [2025-03-04 11:11:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:50,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:11:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:11:50,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:11:50,369 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:11:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:50,411 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-04 11:11:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:11:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 11:11:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:50,414 INFO L225 Difference]: With dead ends: 132 [2025-03-04 11:11:50,414 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 11:11:50,414 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 11:11:50,415 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:50,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 225 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 11:11:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 11:11:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 73 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:11:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2025-03-04 11:11:50,421 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 5 [2025-03-04 11:11:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2025-03-04 11:11:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:11:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2025-03-04 11:11:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 11:11:50,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:50,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:11:50,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1537314989, now seen corresponding path program 1 times [2025-03-04 11:11:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834301346] [2025-03-04 11:11:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:50,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 11:11:50,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 11:11:50,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312373558] [2025-03-04 11:11:50,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:50,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:50,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:50,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:11:50,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 11:11:50,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 11:11:50,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:50,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:50,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:50,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:11:50,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834301346] [2025-03-04 11:11:50,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312373558] [2025-03-04 11:11:50,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312373558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:50,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:50,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653625769] [2025-03-04 11:11:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:50,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:50,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:50,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:50,561 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:11:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:50,660 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2025-03-04 11:11:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:50,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-04 11:11:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:50,661 INFO L225 Difference]: With dead ends: 170 [2025-03-04 11:11:50,661 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 11:11:50,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 11:11:50,662 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:50,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 11:11:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2025-03-04 11:11:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 91 states have internal predecessors, (106), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:11:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2025-03-04 11:11:50,673 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 17 [2025-03-04 11:11:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:50,673 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2025-03-04 11:11:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:11:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2025-03-04 11:11:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:11:50,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:50,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:50,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:11:50,877 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 11:11:50,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:50,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1280236110, now seen corresponding path program 1 times [2025-03-04 11:11:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:50,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249350390] [2025-03-04 11:11:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:50,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:11:50,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:11:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:50,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:50,976 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 11:11:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249350390] [2025-03-04 11:11:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249350390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560428311] [2025-03-04 11:11:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:50,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:50,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:50,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:50,978 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 11:11:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:51,035 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2025-03-04 11:11:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 25 [2025-03-04 11:11:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:51,036 INFO L225 Difference]: With dead ends: 116 [2025-03-04 11:11:51,036 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 11:11:51,036 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 11:11:51,037 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:51,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 127 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 11:11:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2025-03-04 11:11:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6) internal successors, (104), 91 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:11:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-03-04 11:11:51,043 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 25 [2025-03-04 11:11:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:51,043 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-03-04 11:11:51,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 11:11:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-03-04 11:11:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:11:51,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:51,044 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] [2025-03-04 11:11:51,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:11:51,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:51,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1032614934, now seen corresponding path program 1 times [2025-03-04 11:11:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:51,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136490149] [2025-03-04 11:11:51,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:51,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:11:51,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:11:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:51,126 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 11:11:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136490149] [2025-03-04 11:11:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136490149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:11:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085977520] [2025-03-04 11:11:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:51,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:11:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:11:51,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:51,128 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 11:11:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:51,179 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-03-04 11:11:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:11:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 26 [2025-03-04 11:11:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:51,180 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:11:51,180 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 11:11:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:11:51,180 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 203 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 11:11:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 11:11:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 90 states have internal predecessors, (102), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:11:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2025-03-04 11:11:51,192 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 26 [2025-03-04 11:11:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:51,193 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2025-03-04 11:11:51,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 11:11:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2025-03-04 11:11:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:11:51,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:51,193 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] [2025-03-04 11:11:51,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:11:51,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1946291863, now seen corresponding path program 1 times [2025-03-04 11:11:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13223638] [2025-03-04 11:11:51,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:51,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:11:51,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:11:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:51,275 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 11:11:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13223638] [2025-03-04 11:11:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13223638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:51,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:11:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032749367] [2025-03-04 11:11:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:11:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:11:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:51,276 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 11:11:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:51,338 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-03-04 11:11:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:11:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 27 [2025-03-04 11:11:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:51,339 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:11:51,339 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:11:51,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:11:51,340 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:51,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 348 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:11:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-03-04 11:11:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:11:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2025-03-04 11:11:51,352 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 27 [2025-03-04 11:11:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:51,352 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2025-03-04 11:11:51,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 11:11:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2025-03-04 11:11:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:11:51,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:51,353 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] [2025-03-04 11:11:51,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:11:51,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2075706041, now seen corresponding path program 1 times [2025-03-04 11:11:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825684164] [2025-03-04 11:11:51,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:51,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:11:51,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:11:51,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574313744] [2025-03-04 11:11:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:51,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:51,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:11:51,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:11:51,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:11:51,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:51,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:11:51,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:51,443 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 11:11:51,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825684164] [2025-03-04 11:11:51,443 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574313744] [2025-03-04 11:11:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574313744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077656467] [2025-03-04 11:11:51,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:51,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:51,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:51,444 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 11:11:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:51,480 INFO L93 Difference]: Finished difference Result 146 states and 172 transitions. [2025-03-04 11:11:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 29 [2025-03-04 11:11:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:51,481 INFO L225 Difference]: With dead ends: 146 [2025-03-04 11:11:51,482 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:11:51,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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 11:11:51,483 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 43 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:51,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:11:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2025-03-04 11:11:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 111 states have internal predecessors, (131), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:11:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2025-03-04 11:11:51,494 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 29 [2025-03-04 11:11:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2025-03-04 11:11:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 11:11:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2025-03-04 11:11:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:11:51,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:51,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:51,500 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 11:11:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:11:51,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1399081979, now seen corresponding path program 1 times [2025-03-04 11:11:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708725385] [2025-03-04 11:11:51,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:51,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:11:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:11:51,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:11:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708725385] [2025-03-04 11:11:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708725385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976276100] [2025-03-04 11:11:51,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:51,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:51,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:11:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:11:51,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:11:51,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:51,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:51,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:11:51,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:11:51,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976276100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 11:11:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237657898] [2025-03-04 11:11:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:51,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:11:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:51,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:11:51,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:11:51,889 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (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 11:11:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:51,940 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2025-03-04 11:11:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:11:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (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 31 [2025-03-04 11:11:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:51,942 INFO L225 Difference]: With dead ends: 131 [2025-03-04 11:11:51,942 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 11:11:51,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:11:51,943 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:51,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 11:11:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-03-04 11:11:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 110 states have internal predecessors, (130), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:11:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-03-04 11:11:51,951 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 31 [2025-03-04 11:11:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-03-04 11:11:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (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 11:11:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-03-04 11:11:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:11:51,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:51,953 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] [2025-03-04 11:11:51,958 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 11:11:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:52,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1888679643, now seen corresponding path program 1 times [2025-03-04 11:11:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054968254] [2025-03-04 11:11:52,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:52,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:11:52,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:11:52,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:52,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268391298] [2025-03-04 11:11:52,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:52,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:52,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:52,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:11:52,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:11:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:11:52,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:52,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:52,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:52,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:52,294 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 11:11:52,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054968254] [2025-03-04 11:11:52,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268391298] [2025-03-04 11:11:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268391298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:52,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:52,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776000560] [2025-03-04 11:11:52,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:52,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:52,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:52,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:52,295 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 11:11:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:52,361 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2025-03-04 11:11:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 31 [2025-03-04 11:11:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:52,362 INFO L225 Difference]: With dead ends: 139 [2025-03-04 11:11:52,362 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 11:11:52,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 11:11:52,365 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:52,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 93 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 11:11:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-03-04 11:11:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 111 states have internal predecessors, (129), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:11:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2025-03-04 11:11:52,379 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 31 [2025-03-04 11:11:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2025-03-04 11:11:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 11:11:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2025-03-04 11:11:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:11:52,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:52,384 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] [2025-03-04 11:11:52,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:11:52,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:52,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:52,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1580473220, now seen corresponding path program 1 times [2025-03-04 11:11:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:52,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402176349] [2025-03-04 11:11:52,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:52,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:11:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:11:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:52,649 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 11:11:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402176349] [2025-03-04 11:11:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402176349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:52,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:52,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:11:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306707309] [2025-03-04 11:11:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:52,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:11:52,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:52,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:11:52,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:11:52,650 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (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 11:11:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:52,896 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2025-03-04 11:11:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:11:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (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 32 [2025-03-04 11:11:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:52,897 INFO L225 Difference]: With dead ends: 146 [2025-03-04 11:11:52,897 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 11:11:52,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:11:52,898 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 89 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:52,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 155 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:11:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 11:11:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2025-03-04 11:11:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 119 states have internal predecessors, (140), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:11:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2025-03-04 11:11:52,905 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 32 [2025-03-04 11:11:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2025-03-04 11:11:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (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 11:11:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2025-03-04 11:11:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:11:52,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:52,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:52,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:11:52,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -805564817, now seen corresponding path program 1 times [2025-03-04 11:11:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565073760] [2025-03-04 11:11:52,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:52,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:11:52,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:11:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:11:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565073760] [2025-03-04 11:11:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565073760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113324546] [2025-03-04 11:11:52,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:52,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:52,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:52,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:11:52,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:11:52,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:11:52,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:52,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:52,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:52,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:11:53,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:11:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113324546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:53,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:11:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-03-04 11:11:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042767247] [2025-03-04 11:11:53,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:53,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:11:53,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:53,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:11:53,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:53,083 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:11:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:53,155 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2025-03-04 11:11:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:11:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-03-04 11:11:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:53,158 INFO L225 Difference]: With dead ends: 217 [2025-03-04 11:11:53,158 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 11:11:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:11:53,158 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 8 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:53,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 355 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 11:11:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 11:11:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 123 states have internal predecessors, (144), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:11:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2025-03-04 11:11:53,169 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 35 [2025-03-04 11:11:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:53,169 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2025-03-04 11:11:53,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:11:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2025-03-04 11:11:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:11:53,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:53,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:53,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:11:53,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:11:53,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1444754363, now seen corresponding path program 1 times [2025-03-04 11:11:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:53,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836733007] [2025-03-04 11:11:53,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:53,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:11:53,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:11:53,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:53,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011310626] [2025-03-04 11:11:53,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:53,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:53,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:11:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:11:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:11:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:53,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:53,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:11:53,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836733007] [2025-03-04 11:11:53,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011310626] [2025-03-04 11:11:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011310626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:11:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076784376] [2025-03-04 11:11:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:11:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:53,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:11:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:11:53,516 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:53,580 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2025-03-04 11:11:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:11:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-03-04 11:11:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:53,582 INFO L225 Difference]: With dead ends: 174 [2025-03-04 11:11:53,582 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 11:11:53,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:11:53,582 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:53,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 123 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 11:11:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2025-03-04 11:11:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 130 states have internal predecessors, (152), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 11:11:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 180 transitions. [2025-03-04 11:11:53,595 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 180 transitions. Word has length 43 [2025-03-04 11:11:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 180 transitions. [2025-03-04 11:11:53,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 180 transitions. [2025-03-04 11:11:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:11:53,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:53,597 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:53,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:11:53,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:53,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1837712257, now seen corresponding path program 1 times [2025-03-04 11:11:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554212764] [2025-03-04 11:11:53,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:53,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:11:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:11:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825339702] [2025-03-04 11:11:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:53,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:53,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:53,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:11:53,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:11:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:11:53,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:53,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:53,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:53,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:11:53,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554212764] [2025-03-04 11:11:54,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825339702] [2025-03-04 11:11:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825339702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:54,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-04 11:11:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829596549] [2025-03-04 11:11:54,137 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:54,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:11:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:54,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:11:54,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:54,137 INFO L87 Difference]: Start difference. First operand 148 states and 180 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:54,226 INFO L93 Difference]: Finished difference Result 253 states and 318 transitions. [2025-03-04 11:11:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:11:54,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-04 11:11:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:54,228 INFO L225 Difference]: With dead ends: 253 [2025-03-04 11:11:54,228 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 11:11:54,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:54,229 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 64 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:54,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 163 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 11:11:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 219. [2025-03-04 11:11:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 172 states have (on average 1.4186046511627908) internal successors, (244), 192 states have internal predecessors, (244), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 11:11:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2025-03-04 11:11:54,243 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 44 [2025-03-04 11:11:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:54,244 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2025-03-04 11:11:54,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2025-03-04 11:11:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:11:54,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:54,245 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] [2025-03-04 11:11:54,253 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 11:11:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:54,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -625804165, now seen corresponding path program 1 times [2025-03-04 11:11:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956318801] [2025-03-04 11:11:54,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:54,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:11:54,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:11:54,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:54,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:54,510 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 11:11:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956318801] [2025-03-04 11:11:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956318801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:54,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:54,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:11:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504123495] [2025-03-04 11:11:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:11:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:54,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:11:54,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:11:54,511 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:54,574 INFO L93 Difference]: Finished difference Result 224 states and 294 transitions. [2025-03-04 11:11:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:11:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-04 11:11:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:54,576 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:11:54,576 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 11:11:54,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 11:11:54,576 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:54,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 159 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 11:11:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 11:11:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 11:11:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 274 transitions. [2025-03-04 11:11:54,586 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 274 transitions. Word has length 49 [2025-03-04 11:11:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 274 transitions. [2025-03-04 11:11:54,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:11:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2025-03-04 11:11:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:11:54,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:54,586 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] [2025-03-04 11:11:54,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:11:54,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:54,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -14071478, now seen corresponding path program 1 times [2025-03-04 11:11:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083167349] [2025-03-04 11:11:54,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:54,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:11:54,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:11:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083167349] [2025-03-04 11:11:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083167349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152831610] [2025-03-04 11:11:54,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:54,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:54,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:54,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:11:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:11:54,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:11:54,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:54,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:54,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:11:54,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:54,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152831610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:11:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996586983] [2025-03-04 11:11:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:11:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:11:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:11:54,727 INFO L87 Difference]: Start difference. First operand 206 states and 274 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 11:11:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:54,790 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2025-03-04 11:11:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:11:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 51 [2025-03-04 11:11:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:54,792 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:11:54,792 INFO L226 Difference]: Without dead ends: 305 [2025-03-04 11:11:54,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:11:54,792 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:54,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-04 11:11:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 279. [2025-03-04 11:11:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 227 states have (on average 1.4581497797356828) internal successors, (331), 246 states have internal predecessors, (331), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:11:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 389 transitions. [2025-03-04 11:11:54,805 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 389 transitions. Word has length 51 [2025-03-04 11:11:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:54,805 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 389 transitions. [2025-03-04 11:11:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 11:11:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 389 transitions. [2025-03-04 11:11:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:11:54,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:54,806 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:54,812 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 11:11:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:11:55,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -436215789, now seen corresponding path program 1 times [2025-03-04 11:11:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:55,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729041906] [2025-03-04 11:11:55,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:55,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:11:55,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:11:55,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:55,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729041906] [2025-03-04 11:11:55,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729041906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637325960] [2025-03-04 11:11:55,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:55,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:55,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:55,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:55,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:11:55,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:11:55,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:11:55,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:55,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:55,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:11:55,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:55,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637325960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:55,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:11:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:11:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780616206] [2025-03-04 11:11:55,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:55,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:11:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:55,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:11:55,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:11:55,175 INFO L87 Difference]: Start difference. First operand 279 states and 389 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 11:11:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:55,304 INFO L93 Difference]: Finished difference Result 464 states and 638 transitions. [2025-03-04 11:11:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:11:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 52 [2025-03-04 11:11:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:55,307 INFO L225 Difference]: With dead ends: 464 [2025-03-04 11:11:55,307 INFO L226 Difference]: Without dead ends: 462 [2025-03-04 11:11:55,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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 11:11:55,308 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 144 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:55,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 268 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-04 11:11:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 403. [2025-03-04 11:11:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 335 states have (on average 1.462686567164179) internal successors, (490), 354 states have internal predecessors, (490), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 11:11:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 580 transitions. [2025-03-04 11:11:55,327 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 580 transitions. Word has length 52 [2025-03-04 11:11:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 580 transitions. [2025-03-04 11:11:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 11:11:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 580 transitions. [2025-03-04 11:11:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 11:11:55,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:55,328 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:55,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:11:55,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:11:55,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -637825279, now seen corresponding path program 1 times [2025-03-04 11:11:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601932516] [2025-03-04 11:11:55,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:55,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:11:55,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:11:55,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:55,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601932516] [2025-03-04 11:11:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601932516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235501472] [2025-03-04 11:11:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:55,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:55,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:55,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:11:55,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:11:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:11:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:55,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:11:55,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:11:55,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:11:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235501472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:55,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:11:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 11:11:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509720249] [2025-03-04 11:11:55,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:11:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:55,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:11:55,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:11:55,802 INFO L87 Difference]: Start difference. First operand 403 states and 580 transitions. Second operand has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 11:11:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:55,980 INFO L93 Difference]: Finished difference Result 609 states and 851 transitions. [2025-03-04 11:11:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:11:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 53 [2025-03-04 11:11:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:55,983 INFO L225 Difference]: With dead ends: 609 [2025-03-04 11:11:55,983 INFO L226 Difference]: Without dead ends: 608 [2025-03-04 11:11:55,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:11:55,984 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 158 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:55,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 610 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:11:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-04 11:11:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 574. [2025-03-04 11:11:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 492 states have (on average 1.420731707317073) internal successors, (699), 511 states have internal predecessors, (699), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 11:11:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 813 transitions. [2025-03-04 11:11:56,004 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 813 transitions. Word has length 53 [2025-03-04 11:11:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 813 transitions. [2025-03-04 11:11:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 11:11:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 813 transitions. [2025-03-04 11:11:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 11:11:56,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:56,005 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:56,011 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 11:11:56,205 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,SelfDestructingSolverStorable16 [2025-03-04 11:11:56,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:56,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash 848255981, now seen corresponding path program 1 times [2025-03-04 11:11:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:56,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763506171] [2025-03-04 11:11:56,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:11:56,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:11:56,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:56,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:11:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704630317] [2025-03-04 11:11:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:56,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:56,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:11:56,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:11:56,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:11:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:56,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:11:56,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 11:11:56,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:11:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763506171] [2025-03-04 11:11:56,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704630317] [2025-03-04 11:11:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704630317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308699545] [2025-03-04 11:11:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:56,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:56,323 INFO L87 Difference]: Start difference. First operand 574 states and 813 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 11:11:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:56,374 INFO L93 Difference]: Finished difference Result 605 states and 862 transitions. [2025-03-04 11:11:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 58 [2025-03-04 11:11:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:56,377 INFO L225 Difference]: With dead ends: 605 [2025-03-04 11:11:56,377 INFO L226 Difference]: Without dead ends: 600 [2025-03-04 11:11:56,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 11:11:56,377 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:56,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 85 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-04 11:11:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 571. [2025-03-04 11:11:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 489 states have (on average 1.3803680981595092) internal successors, (675), 508 states have internal predecessors, (675), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 11:11:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 789 transitions. [2025-03-04 11:11:56,412 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 789 transitions. Word has length 58 [2025-03-04 11:11:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:56,412 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 789 transitions. [2025-03-04 11:11:56,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 11:11:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 789 transitions. [2025-03-04 11:11:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:11:56,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:56,413 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 11:11:56,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:11:56,613 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,SelfDestructingSolverStorable17 [2025-03-04 11:11:56,613 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1939537433, now seen corresponding path program 2 times [2025-03-04 11:11:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047553734] [2025-03-04 11:11:56,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:11:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:56,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 11:11:56,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:11:56,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:11:56,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:11:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047553734] [2025-03-04 11:11:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047553734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370382188] [2025-03-04 11:11:56,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:11:56,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:56,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:11:56,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:11:56,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:11:56,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 11:11:56,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:11:56,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:11:56,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:56,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:11:56,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:11:56,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:11:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370382188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:11:56,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:11:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 9 [2025-03-04 11:11:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805476352] [2025-03-04 11:11:56,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:56,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:11:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:56,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:11:56,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:11:56,892 INFO L87 Difference]: Start difference. First operand 571 states and 789 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 11:11:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:56,958 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2025-03-04 11:11:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:11:56,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 70 [2025-03-04 11:11:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:56,960 INFO L225 Difference]: With dead ends: 705 [2025-03-04 11:11:56,961 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 11:11:56,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:11:56,961 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:56,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 11:11:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-04 11:11:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.3360655737704918) internal successors, (326), 259 states have internal predecessors, (326), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 11:11:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 378 transitions. [2025-03-04 11:11:56,987 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 378 transitions. Word has length 70 [2025-03-04 11:11:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 378 transitions. [2025-03-04 11:11:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 11:11:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 378 transitions. [2025-03-04 11:11:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 11:11:56,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:56,989 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:56,995 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 11:11:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:11:57,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2125991616, now seen corresponding path program 1 times [2025-03-04 11:11:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715875197] [2025-03-04 11:11:57,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:57,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:11:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:11:57,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:11:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715875197] [2025-03-04 11:11:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715875197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:11:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908320506] [2025-03-04 11:11:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:57,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:11:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:11:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:11:57,233 INFO L87 Difference]: Start difference. First operand 291 states and 378 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:11:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:57,270 INFO L93 Difference]: Finished difference Result 317 states and 391 transitions. [2025-03-04 11:11:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:11:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 73 [2025-03-04 11:11:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:57,272 INFO L225 Difference]: With dead ends: 317 [2025-03-04 11:11:57,272 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 11:11:57,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:11:57,273 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:57,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 245 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 11:11:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-04 11:11:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.277027027027027) internal successors, (189), 161 states have internal predecessors, (189), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:11:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 221 transitions. [2025-03-04 11:11:57,285 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 221 transitions. Word has length 73 [2025-03-04 11:11:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 221 transitions. [2025-03-04 11:11:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:11:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 221 transitions. [2025-03-04 11:11:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:11:57,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:57,286 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:11:57,286 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash -781341198, now seen corresponding path program 1 times [2025-03-04 11:11:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:57,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401344093] [2025-03-04 11:11:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:11:57,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:11:57,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:57,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:11:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401344093] [2025-03-04 11:11:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401344093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:57,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:11:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026923131] [2025-03-04 11:11:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:57,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:11:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:57,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:11:57,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:11:57,334 INFO L87 Difference]: Start difference. First operand 183 states and 221 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 11:11:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:57,374 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2025-03-04 11:11:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:11:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 77 [2025-03-04 11:11:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:57,375 INFO L225 Difference]: With dead ends: 183 [2025-03-04 11:11:57,375 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 11:11:57,375 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 11:11:57,376 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:57,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 11:11:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 11:11:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 1.2567567567567568) internal successors, (186), 160 states have internal predecessors, (186), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:11:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2025-03-04 11:11:57,385 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 77 [2025-03-04 11:11:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2025-03-04 11:11:57,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 11:11:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2025-03-04 11:11:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:11:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:11:57,386 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 11:11:57,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:11:57,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:11:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:11:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1548226625, now seen corresponding path program 1 times [2025-03-04 11:11:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:11:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607863842] [2025-03-04 11:11:57,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:11:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:11:57,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:11:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:11:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:11:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:11:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:11:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607863842] [2025-03-04 11:11:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607863842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:11:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:11:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:11:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851709719] [2025-03-04 11:11:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:11:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:11:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:57,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:11:57,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:11:57,476 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:11:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:11:57,534 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-04 11:11:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:11:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 78 [2025-03-04 11:11:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:11:57,537 INFO L225 Difference]: With dead ends: 182 [2025-03-04 11:11:57,537 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:11:57,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:11:57,538 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:11:57,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:11:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:11:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:11:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:11:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:11:57,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-03-04 11:11:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:11:57,539 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:11:57,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:11:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:11:57,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:11:57,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-03-04 11:11:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-03-04 11:11:57,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-03-04 11:11:57,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-03-04 11:11:57,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-03-04 11:11:57,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-03-04 11:11:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:11:57,547 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:11:57,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:11:57,793 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:11:57,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:11:57 BoogieIcfgContainer [2025-03-04 11:11:57,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:11:57,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:11:57,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:11:57,808 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:11:57,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:11:49" (3/4) ... [2025-03-04 11:11:57,810 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:11:57,816 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:11:57,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 11:11:57,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 11:11:57,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:11:57,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:11:57,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:11:57,888 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:11:57,889 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:11:57,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:11:57,891 INFO L158 Benchmark]: Toolchain (without parser) took 8452.30ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.6MB in the beginning and 172.7MB in the end (delta: -68.1MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,892 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:11:57,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 129.46ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 93.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.02ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,892 INFO L158 Benchmark]: Boogie Preprocessor took 25.90ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:11:57,892 INFO L158 Benchmark]: IcfgBuilder took 331.53ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 74.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,893 INFO L158 Benchmark]: TraceAbstraction took 7842.43ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 73.0MB in the beginning and 178.1MB in the end (delta: -105.0MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,893 INFO L158 Benchmark]: Witness Printer took 82.83ms. Allocated memory is still 327.2MB. Free memory was 178.1MB in the beginning and 172.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:11:57,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 129.46ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 93.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.02ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.90ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 331.53ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 74.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7842.43ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 73.0MB in the beginning and 178.1MB in the end (delta: -105.0MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * Witness Printer took 82.83ms. Allocated memory is still 327.2MB. Free memory was 178.1MB in the beginning and 172.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 22, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1008 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 4555 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3088 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1467 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 713 SyntacticMatches, 9 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=17, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 265 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 3312 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1441 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 1567/1703 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((((((d == 1) && (p == 1)) && (r <= 2147483647)) && (q == 0)) && (counter == 0)) && (B == 1)) && (0 <= (r + 2147483648))) || (((((((r <= 2147483647) && (2 == p)) && (q == 0)) && (counter == 1)) && (B == 1)) && (2 == d)) && (0 <= (r + 2147483648)))) || ((((((((r <= 2147483647) && (d <= 536870911)) && (2 <= p)) && (2 <= d)) && (q == 0)) && (B == 1)) && (counter == 2)) && (0 <= (r + 2147483648)))) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((((((((((counter == 3) && (d <= 1073741823)) && (r <= 2147483647)) && (2 <= p)) && (2 <= d)) && (q == 0)) && (B == 1)) && (0 <= (r + 2147483648))) || (((((((r <= 2147483647) && (2 == p)) && (q == 0)) && (B == 1)) && (2 == d)) && (counter == 2)) && (0 <= (r + 2147483648)))) || (((((((d == 1) && (p == 1)) && (q == 0)) && (r <= 0)) && (counter == 1)) && (B == 1)) && (0 <= (r + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:11:57,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE