./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound20.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/ps2-ll_valuebound20.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 ccc90f911eb65e070ad46258a83153891dc4d8a5addf20ee75047318144d790b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:19:33,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:19:33,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:19:33,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:19:33,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:19:33,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:19:33,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:19:33,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:19:33,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:19:33,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:19:33,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:19:33,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:19:33,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:19:33,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:19:33,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:19:33,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:19:33,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:19:33,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:19:33,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:19:33,632 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 -> ccc90f911eb65e070ad46258a83153891dc4d8a5addf20ee75047318144d790b [2025-03-04 11:19:33,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:19:33,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:19:33,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:19:33,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:19:33,849 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:19:33,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound20.c [2025-03-04 11:19:34,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3edb6b9/1f9d16a52db54b79a44fb58e48672ef2/FLAG9cba6b959 [2025-03-04 11:19:35,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:19:35,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound20.c [2025-03-04 11:19:35,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3edb6b9/1f9d16a52db54b79a44fb58e48672ef2/FLAG9cba6b959 [2025-03-04 11:19:35,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3edb6b9/1f9d16a52db54b79a44fb58e48672ef2 [2025-03-04 11:19:35,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:19:35,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:19:35,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:19:35,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:19:35,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:19:35,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a192f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35, skipping insertion in model container [2025-03-04 11:19:35,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:19:35,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:19:35,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:19:35,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:19:35,645 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:19:35,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35 WrapperNode [2025-03-04 11:19:35,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:19:35,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:19:35,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:19:35,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:19:35,650 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:19:35" (1/1) ... [2025-03-04 11:19:35,654 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:19:35" (1/1) ... [2025-03-04 11:19:35,663 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-04 11:19:35,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:19:35,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:19:35,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:19:35,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:19:35,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:19:35,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:19:35,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:19:35,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:19:35,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:19:35,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (1/1) ... [2025-03-04 11:19:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:19:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:35,709 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:19:35,711 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:19:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:19:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:19:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:19:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:19:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:19:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:19:35,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:19:35,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:19:35,958 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-04 11:19:35,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:19:35,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:19:35,967 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:19:35,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:19:35 BoogieIcfgContainer [2025-03-04 11:19:35,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:19:35,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:19:35,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:19:35,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:19:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:19:35" (1/3) ... [2025-03-04 11:19:35,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8e600c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:19:35, skipping insertion in model container [2025-03-04 11:19:35,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:19:35" (2/3) ... [2025-03-04 11:19:35,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8e600c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:19:35, skipping insertion in model container [2025-03-04 11:19:35,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:19:35" (3/3) ... [2025-03-04 11:19:35,976 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound20.c [2025-03-04 11:19:35,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:19:35,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_valuebound20.c that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-03-04 11:19:36,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:19:36,035 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;@29325bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:19:36,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 11:19:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:19:36,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:19:36,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 82037427, now seen corresponding path program 1 times [2025-03-04 11:19:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821574080] [2025-03-04 11:19:36,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:19:36,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:19:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:36,137 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:19:36,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:36,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821574080] [2025-03-04 11:19:36,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821574080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:36,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:19:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330399491] [2025-03-04 11:19:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:36,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:19:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:36,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:19:36,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:19:36,158 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:19:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:36,174 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2025-03-04 11:19:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:19:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:19:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:36,179 INFO L225 Difference]: With dead ends: 116 [2025-03-04 11:19:36,179 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 11:19:36,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:19:36,184 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:36,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 11:19:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 11:19:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-03-04 11:19:36,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2025-03-04 11:19:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-03-04 11:19:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:19:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-03-04 11:19:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:19:36,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:19:36,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:19:36,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1751777251, now seen corresponding path program 1 times [2025-03-04 11:19:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807195285] [2025-03-04 11:19:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:19:36,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:19:36,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:19:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468608981] [2025-03-04 11:19:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:36,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:36,228 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:19:36,230 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:19:36,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:19:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:19:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:36,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:19:36,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:36,303 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:19:36,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:19:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807195285] [2025-03-04 11:19:36,303 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:19:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468608981] [2025-03-04 11:19:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468608981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:19:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220637439] [2025-03-04 11:19:36,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:19:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:36,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:19:36,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:19:36,306 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:36,369 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-03-04 11:19:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:19:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:19:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:36,370 INFO L225 Difference]: With dead ends: 84 [2025-03-04 11:19:36,370 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:19:36,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:19:36,371 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:36,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:19:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-03-04 11:19:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 11:19:36,376 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 6 [2025-03-04 11:19:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:36,376 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 11:19:36,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 11:19:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:19:36,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:36,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:19:36,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:36,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1529480082, now seen corresponding path program 1 times [2025-03-04 11:19:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456726539] [2025-03-04 11:19:36,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:19:36,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:19:36,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:36,631 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:19:36,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:36,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456726539] [2025-03-04 11:19:36,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456726539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:36,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:19:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007058814] [2025-03-04 11:19:36,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:36,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:19:36,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:36,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:19:36,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:19:36,633 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:36,700 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-03-04 11:19:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:19:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:19:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:36,701 INFO L225 Difference]: With dead ends: 86 [2025-03-04 11:19:36,701 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 11:19:36,702 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:19:36,702 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:36,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 11:19:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-03-04 11:19:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-03-04 11:19:36,714 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 7 [2025-03-04 11:19:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:36,714 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-03-04 11:19:36,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-03-04 11:19:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:19:36,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:36,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:19:36,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash -566907559, now seen corresponding path program 1 times [2025-03-04 11:19:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519411558] [2025-03-04 11:19:36,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:19:36,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:19:36,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:36,805 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:19:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519411558] [2025-03-04 11:19:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519411558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:19:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509823429] [2025-03-04 11:19:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:19:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:36,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:19:36,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:36,808 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:36,883 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2025-03-04 11:19:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:19:36,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:19:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:36,884 INFO L225 Difference]: With dead ends: 82 [2025-03-04 11:19:36,884 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 11:19:36,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:36,885 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:36,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 11:19:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-03-04 11:19:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-04 11:19:36,890 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-03-04 11:19:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-04 11:19:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:19:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-04 11:19:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:19:36,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:19:36,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1704329907, now seen corresponding path program 1 times [2025-03-04 11:19:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208725916] [2025-03-04 11:19:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:19:36,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:19:36,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:36,962 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:19:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208725916] [2025-03-04 11:19:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208725916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:36,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:19:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21432243] [2025-03-04 11:19:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:19:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:19:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:19:36,964 INFO L87 Difference]: Start difference. First operand 66 states and 69 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:36,981 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2025-03-04 11:19:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:19:36,982 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 11:19:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:36,982 INFO L225 Difference]: With dead ends: 68 [2025-03-04 11:19:36,982 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 11:19:36,983 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:19:36,983 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:36,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 11:19:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 11:19:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 62 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-03-04 11:19:36,989 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 19 [2025-03-04 11:19:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-03-04 11:19:36,990 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-03-04 11:19:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:19:36,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:36,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:19:36,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash 794793545, now seen corresponding path program 1 times [2025-03-04 11:19:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116112628] [2025-03-04 11:19:36,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:36,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:19:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:19:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:37,083 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:19:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116112628] [2025-03-04 11:19:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116112628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:37,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:37,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:19:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435066452] [2025-03-04 11:19:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:37,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:19:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:37,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:19:37,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:37,086 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:37,154 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-03-04 11:19:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:19:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 11:19:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:37,155 INFO L225 Difference]: With dead ends: 69 [2025-03-04 11:19:37,155 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:19:37,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:37,155 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:37,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:19:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-04 11:19:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 63 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2025-03-04 11:19:37,161 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 23 [2025-03-04 11:19:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2025-03-04 11:19:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2025-03-04 11:19:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:19:37,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:37,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:19:37,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1131203891, now seen corresponding path program 1 times [2025-03-04 11:19:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172728991] [2025-03-04 11:19:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:37,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:19:37,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:19:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:37,235 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:19:37,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:37,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172728991] [2025-03-04 11:19:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172728991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:19:37,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:19:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592849716] [2025-03-04 11:19:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:19:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:37,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:19:37,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:37,236 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:37,304 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2025-03-04 11:19:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:19:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-04 11:19:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:37,305 INFO L225 Difference]: With dead ends: 69 [2025-03-04 11:19:37,305 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:19:37,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:19:37,306 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:37,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:19:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 11:19:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-03-04 11:19:37,309 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 24 [2025-03-04 11:19:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:37,310 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-03-04 11:19:37,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-03-04 11:19:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:19:37,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:37,310 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:37,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:19:37,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:37,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -460212757, now seen corresponding path program 1 times [2025-03-04 11:19:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983785996] [2025-03-04 11:19:37,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:37,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:19:37,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:19:37,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:19:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400059458] [2025-03-04 11:19:37,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:37,332 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:19:37,334 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:19:37,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:19:37,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:19:37,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:37,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:19:37,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:37,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983785996] [2025-03-04 11:19:37,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:19:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400059458] [2025-03-04 11:19:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400059458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:37,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:19:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:19:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579391236] [2025-03-04 11:19:37,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:19:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:37,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:19:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:19:37,493 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:37,619 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2025-03-04 11:19:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:19:37,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 11:19:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:37,622 INFO L225 Difference]: With dead ends: 131 [2025-03-04 11:19:37,622 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 11:19:37,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:19:37,622 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:37,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 11:19:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2025-03-04 11:19:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 93 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:19:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-03-04 11:19:37,631 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 26 [2025-03-04 11:19:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:37,631 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-03-04 11:19:37,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-03-04 11:19:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:19:37,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:37,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:37,641 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:19:37,841 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,SelfDestructingSolverStorable7 [2025-03-04 11:19:37,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:37,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1381693564, now seen corresponding path program 1 times [2025-03-04 11:19:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957427436] [2025-03-04 11:19:37,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:37,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:19:37,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:19:37,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957427436] [2025-03-04 11:19:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957427436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771943602] [2025-03-04 11:19:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:37,924 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:19:37,926 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:19:37,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:19:37,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:19:37,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:37,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:19:37,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:38,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771943602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:38,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:19:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142866437] [2025-03-04 11:19:38,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:38,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:19:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:38,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:19:38,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:19:38,093 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:19:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:38,194 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2025-03-04 11:19:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:19:38,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2025-03-04 11:19:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:38,195 INFO L225 Difference]: With dead ends: 99 [2025-03-04 11:19:38,195 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 11:19:38,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:19:38,196 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:38,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 11:19:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 11:19:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 90 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:19:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-03-04 11:19:38,207 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 27 [2025-03-04 11:19:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-03-04 11:19:38,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:19:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-03-04 11:19:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:19:38,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:38,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:38,214 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:19:38,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:38,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:38,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 117172489, now seen corresponding path program 1 times [2025-03-04 11:19:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346228416] [2025-03-04 11:19:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:38,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:19:38,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:19:38,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:38,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346228416] [2025-03-04 11:19:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346228416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584734744] [2025-03-04 11:19:38,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:38,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:38,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:38,465 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:19:38,465 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:19:38,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:19:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:19:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:19:38,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:38,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584734744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:38,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:38,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:19:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553587144] [2025-03-04 11:19:38,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:19:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:19:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:19:38,639 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:19:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:38,770 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-03-04 11:19:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:19:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-03-04 11:19:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:38,771 INFO L225 Difference]: With dead ends: 108 [2025-03-04 11:19:38,771 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 11:19:38,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:19:38,772 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:38,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 80 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 11:19:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-04 11:19:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:19:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-03-04 11:19:38,785 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 28 [2025-03-04 11:19:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-03-04 11:19:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:19:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-03-04 11:19:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:19:38,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:38,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:38,792 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:19:38,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:38,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 933612583, now seen corresponding path program 1 times [2025-03-04 11:19:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058133597] [2025-03-04 11:19:38,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:38,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:19:38,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:19:38,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:38,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:39,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058133597] [2025-03-04 11:19:39,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058133597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:39,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101569342] [2025-03-04 11:19:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:39,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:39,060 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:19:39,061 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:19:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:19:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:19:39,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:19:39,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:39,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:19:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101569342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:19:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:19:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721379544] [2025-03-04 11:19:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:39,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:19:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:39,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:19:39,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:19:39,202 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:39,257 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-04 11:19:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:19:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:19:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:39,258 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:19:39,258 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 11:19:39,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:19:39,258 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:39,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 11:19:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 11:19:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:19:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-04 11:19:39,267 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2025-03-04 11:19:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-04 11:19:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:19:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-04 11:19:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:19:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:39,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:39,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:19:39,473 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:19:39,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 223651391, now seen corresponding path program 1 times [2025-03-04 11:19:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525933757] [2025-03-04 11:19:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:39,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:19:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:19:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:19:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525933757] [2025-03-04 11:19:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525933757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616163472] [2025-03-04 11:19:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:39,523 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:19:39,524 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:19:39,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:19:39,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:19:39,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:39,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:19:39,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:19:39,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:19:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616163472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:19:39,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:19:39,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468036680] [2025-03-04 11:19:39,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:19:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:39,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:19:39,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:19:39,595 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:39,606 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 11:19:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:19:39,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-03-04 11:19:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:39,607 INFO L225 Difference]: With dead ends: 79 [2025-03-04 11:19:39,607 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 11:19:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:19:39,608 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:39,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 11:19:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 11:19:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:19:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-04 11:19:39,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 39 [2025-03-04 11:19:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-04 11:19:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-04 11:19:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:19:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:39,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:39,623 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:19:39,817 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:19:39,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1656741473, now seen corresponding path program 1 times [2025-03-04 11:19:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114178529] [2025-03-04 11:19:39,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:19:39,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:19:39,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:39,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:19:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114178529] [2025-03-04 11:19:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114178529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428416169] [2025-03-04 11:19:39,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:39,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:39,853 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:19:39,855 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:19:39,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:19:39,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:19:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:39,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:19:39,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:19:39,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:19:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428416169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:39,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:19:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476293461] [2025-03-04 11:19:39,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:39,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:19:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:39,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:19:39,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:19:39,969 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:19:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:39,996 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-03-04 11:19:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:19:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 40 [2025-03-04 11:19:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:39,997 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:19:39,997 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 11:19:39,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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:19:39,998 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:39,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 11:19:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 11:19:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:19:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-04 11:19:40,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2025-03-04 11:19:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:40,005 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-04 11:19:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:19:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-04 11:19:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 11:19:40,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:40,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 11:19:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:19:40,206 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:19:40,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:40,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash -44483479, now seen corresponding path program 1 times [2025-03-04 11:19:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:40,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386233937] [2025-03-04 11:19:40,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:40,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 11:19:40,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:19:40,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:40,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386233937] [2025-03-04 11:19:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386233937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710738619] [2025-03-04 11:19:40,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:19:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:40,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:40,327 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:19:40,329 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:19:40,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 11:19:40,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:19:40,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:19:40,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:40,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:19:40,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:40,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710738619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:40,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 11:19:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100412840] [2025-03-04 11:19:40,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:19:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:40,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:19:40,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:19:40,686 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:19:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:40,883 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2025-03-04 11:19:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:19:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 64 [2025-03-04 11:19:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:40,885 INFO L225 Difference]: With dead ends: 127 [2025-03-04 11:19:40,885 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 11:19:40,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:19:40,886 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:40,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 11:19:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-03-04 11:19:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 115 states have internal predecessors, (123), 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:19:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2025-03-04 11:19:40,894 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 64 [2025-03-04 11:19:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:40,894 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2025-03-04 11:19:40,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:19:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2025-03-04 11:19:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:19:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:40,895 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:19:40,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:19:41,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:19:41,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:41,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -64240475, now seen corresponding path program 2 times [2025-03-04 11:19:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183112005] [2025-03-04 11:19:41,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:41,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-04 11:19:41,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:19:41,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:19:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183112005] [2025-03-04 11:19:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183112005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099072282] [2025-03-04 11:19:41,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:41,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:41,220 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:19:41,221 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:19:41,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-04 11:19:41,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:19:41,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:19:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:41,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:19:41,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:41,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:19:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099072282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:41,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:41,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 11:19:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31681918] [2025-03-04 11:19:41,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:41,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:19:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:41,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:19:41,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:19:41,611 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:19:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:41,867 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-04 11:19:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:19:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 68 [2025-03-04 11:19:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:41,868 INFO L225 Difference]: With dead ends: 132 [2025-03-04 11:19:41,868 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 11:19:41,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:19:41,869 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:41,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 97 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 11:19:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-04 11:19:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 119 states have internal predecessors, (125), 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:19:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-03-04 11:19:41,874 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 68 [2025-03-04 11:19:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:41,875 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-03-04 11:19:41,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:19:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-03-04 11:19:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:19:41,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:41,876 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:19:41,881 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:19:42,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:19:42,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -342284971, now seen corresponding path program 2 times [2025-03-04 11:19:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658499531] [2025-03-04 11:19:42,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:42,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 11:19:42,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:19:42,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:19:42,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:19:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935113544] [2025-03-04 11:19:42,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:42,097 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:19:42,098 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:19:42,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 11:19:42,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:19:42,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:19:42,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:42,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:19:42,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:19:42,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:19:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658499531] [2025-03-04 11:19:42,403 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:19:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935113544] [2025-03-04 11:19:42,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935113544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:42,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:19:42,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:19:42,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588619657] [2025-03-04 11:19:42,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:42,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:19:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:42,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:19:42,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:19:42,404 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:19:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:42,686 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2025-03-04 11:19:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:19:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2025-03-04 11:19:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:42,688 INFO L225 Difference]: With dead ends: 182 [2025-03-04 11:19:42,688 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 11:19:42,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:19:42,689 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:42,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 251 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:19:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 11:19:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2025-03-04 11:19:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 159 states have (on average 1.0880503144654088) internal successors, (173), 162 states have internal predecessors, (173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:19:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2025-03-04 11:19:42,698 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 86 [2025-03-04 11:19:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2025-03-04 11:19:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:19:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2025-03-04 11:19:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:19:42,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:42,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:19:42,706 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:19:42,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:19:42,900 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1544335479, now seen corresponding path program 2 times [2025-03-04 11:19:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114727410] [2025-03-04 11:19:42,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:42,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 11:19:42,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-03-04 11:19:42,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:19:42,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 11:19:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114727410] [2025-03-04 11:19:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114727410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564427809] [2025-03-04 11:19:42,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:42,925 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:19:42,927 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:19:42,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 11:19:42,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-03-04 11:19:42,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:19:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:42,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:19:42,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 11:19:43,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 11:19:43,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564427809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:43,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:43,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 11:19:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593293357] [2025-03-04 11:19:43,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:43,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:19:43,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:43,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:19:43,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:19:43,130 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:43,154 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2025-03-04 11:19:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:19:43,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-03-04 11:19:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:43,156 INFO L225 Difference]: With dead ends: 174 [2025-03-04 11:19:43,156 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 11:19:43,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:19:43,157 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:19:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 11:19:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-04 11:19:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 159 states have (on average 1.050314465408805) internal successors, (167), 161 states have internal predecessors, (167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:19:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2025-03-04 11:19:43,166 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 100 [2025-03-04 11:19:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:43,166 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2025-03-04 11:19:43,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2025-03-04 11:19:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 11:19:43,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:43,167 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-03-04 11:19:43,173 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:19:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:19:43,368 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:43,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1510413407, now seen corresponding path program 2 times [2025-03-04 11:19:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065886713] [2025-03-04 11:19:43,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:43,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 11:19:43,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 11:19:43,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:19:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:19:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065886713] [2025-03-04 11:19:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065886713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793612159] [2025-03-04 11:19:43,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:19:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:43,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:43,705 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:19:43,706 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:19:43,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 11:19:43,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 144 statements. [2025-03-04 11:19:43,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:19:43,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:43,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:19:43,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 11:19:43,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:19:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793612159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:43,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:19:43,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-03-04 11:19:43,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030536125] [2025-03-04 11:19:43,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:43,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:19:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:43,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:19:43,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:19:43,925 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:44,012 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2025-03-04 11:19:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:19:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 144 [2025-03-04 11:19:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:44,014 INFO L225 Difference]: With dead ends: 175 [2025-03-04 11:19:44,014 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:19:44,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:19:44,015 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:44,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:19:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-04 11:19:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.0251572327044025) internal successors, (163), 160 states have internal predecessors, (163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:19:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2025-03-04 11:19:44,026 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 144 [2025-03-04 11:19:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:44,026 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2025-03-04 11:19:44,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2025-03-04 11:19:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 11:19:44,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:44,028 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 11:19:44,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:19:44,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:19:44,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:19:44,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash -495904803, now seen corresponding path program 3 times [2025-03-04 11:19:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:44,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135500105] [2025-03-04 11:19:44,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:19:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:44,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-03-04 11:19:44,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 11:19:44,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 11:19:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:19:44,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135500105] [2025-03-04 11:19:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135500105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678629605] [2025-03-04 11:19:44,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:19:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:44,573 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:19:44,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:19:44,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-03-04 11:19:44,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 148 statements. [2025-03-04 11:19:44,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:19:44,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:44,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:19:44,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:20:06,316 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-03-04 11:20:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 11:20:10,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:20:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678629605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:20:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:20:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-03-04 11:20:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470622830] [2025-03-04 11:20:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:20:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:20:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:20:10,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:20:10,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-04 11:20:10,344 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:20:14,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:20:28,099 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 11:20:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:20:36,389 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2025-03-04 11:20:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:20:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-03-04 11:20:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:20:36,391 INFO L225 Difference]: With dead ends: 174 [2025-03-04 11:20:36,391 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 11:20:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=116, Invalid=641, Unknown=3, NotChecked=52, Total=812 [2025-03-04 11:20:36,391 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:20:36,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 35 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 1 Unknown, 40 Unchecked, 4.2s Time] [2025-03-04 11:20:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 11:20:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-04 11:20:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.0062893081761006) internal successors, (160), 159 states have internal predecessors, (160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:20:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 180 transitions. [2025-03-04 11:20:36,401 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 180 transitions. Word has length 148 [2025-03-04 11:20:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:20:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 180 transitions. [2025-03-04 11:20:36,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:20:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 180 transitions. [2025-03-04 11:20:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-04 11:20:36,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:20:36,403 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 11:20:36,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:20:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:20:36,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:20:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:20:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 472277801, now seen corresponding path program 3 times [2025-03-04 11:20:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:20:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042635386] [2025-03-04 11:20:36,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:20:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:20:36,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-03-04 11:20:36,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-03-04 11:20:36,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:20:36,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:20:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287589198] [2025-03-04 11:20:36,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:20:36,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:20:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:20:36,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:20:36,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:20:36,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-03-04 11:20:36,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-03-04 11:20:36,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:20:36,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:20:36,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:20:36,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:20:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 0 proven. 740 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:20:37,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:20:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 0 proven. 740 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:20:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:20:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042635386] [2025-03-04 11:20:37,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:20:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287589198] [2025-03-04 11:20:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287589198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:20:37,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:20:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-04 11:20:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473630732] [2025-03-04 11:20:37,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:20:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:20:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:20:37,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:20:37,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:20:37,616 INFO L87 Difference]: Start difference. First operand 171 states and 180 transitions. Second operand has 24 states, 23 states have (on average 13.565217391304348) internal successors, (312), 24 states have internal predecessors, (312), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:20:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:20:38,781 INFO L93 Difference]: Finished difference Result 364 states and 396 transitions. [2025-03-04 11:20:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:20:38,781 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 13.565217391304348) internal successors, (312), 24 states have internal predecessors, (312), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 206 [2025-03-04 11:20:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:20:38,782 INFO L225 Difference]: With dead ends: 364 [2025-03-04 11:20:38,782 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 11:20:38,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:20:38,783 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 145 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:20:38,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 893 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:20:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 11:20:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-04 11:20:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 339 states have (on average 1.0029498525073746) internal successors, (340), 339 states have internal predecessors, (340), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:20:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 384 transitions. [2025-03-04 11:20:38,808 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 384 transitions. Word has length 206 [2025-03-04 11:20:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:20:38,808 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 384 transitions. [2025-03-04 11:20:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 13.565217391304348) internal successors, (312), 24 states have internal predecessors, (312), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:20:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 384 transitions. [2025-03-04 11:20:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-04 11:20:38,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:20:38,813 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 11:20:38,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:20:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:20:39,014 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:20:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:20:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -908043567, now seen corresponding path program 4 times [2025-03-04 11:20:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:20:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314018937] [2025-03-04 11:20:39,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:20:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:20:39,026 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 446 statements into 2 equivalence classes. [2025-03-04 11:20:39,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:20:39,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:20:39,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:20:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4664 backedges. 3740 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 11:20:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:20:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314018937] [2025-03-04 11:20:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314018937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:20:40,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:20:40,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-04 11:20:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868756654] [2025-03-04 11:20:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:20:40,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:20:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:20:40,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:20:40,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:20:40,126 INFO L87 Difference]: Start difference. First operand 363 states and 384 transitions. Second operand has 26 states, 26 states have (on average 13.038461538461538) internal successors, (339), 26 states have internal predecessors, (339), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:20:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:20:40,620 INFO L93 Difference]: Finished difference Result 367 states and 387 transitions. [2025-03-04 11:20:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:20:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.038461538461538) internal successors, (339), 26 states have internal predecessors, (339), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 446 [2025-03-04 11:20:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:20:40,621 INFO L225 Difference]: With dead ends: 367 [2025-03-04 11:20:40,621 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:20:40,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=784, Invalid=1378, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:20:40,624 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 16 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:20:40,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1273 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:20:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:20:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:20:40,625 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:20:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:20:40,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 446 [2025-03-04 11:20:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:20:40,625 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:20:40,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.038461538461538) internal successors, (339), 26 states have internal predecessors, (339), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:20:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:20:40,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:20:40,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-04 11:20:40,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-04 11:20:40,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:20:40,630 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:20:40,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.