./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound100.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 4ecd26f30dcf2e00e51585057257a3ebe53fdc2d12652276addf710ad43d7dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:53:04,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:53:04,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:53:04,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:53:04,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:53:04,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:53:04,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:53:04,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:53:04,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:53:04,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:53:04,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:53:04,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:53:04,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:53:04,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:53:04,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:53:04,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:53:04,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:53:04,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:53:04,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:53:04,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:04,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:53:04,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:53:04,702 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 -> 4ecd26f30dcf2e00e51585057257a3ebe53fdc2d12652276addf710ad43d7dfd [2025-03-04 10:53:04,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:53:04,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:53:04,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:53:04,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:53:04,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:53:04,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound100.c [2025-03-04 10:53:06,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b757ddac8/11053e81eff842688dcc393e8cee64b7/FLAG287624e2e [2025-03-04 10:53:06,267 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:53:06,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound100.c [2025-03-04 10:53:06,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b757ddac8/11053e81eff842688dcc393e8cee64b7/FLAG287624e2e [2025-03-04 10:53:06,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b757ddac8/11053e81eff842688dcc393e8cee64b7 [2025-03-04 10:53:06,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:53:06,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:53:06,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:06,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:53:06,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:53:06,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10913a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06, skipping insertion in model container [2025-03-04 10:53:06,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:53:06,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:06,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:53:06,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:06,763 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:53:06,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06 WrapperNode [2025-03-04 10:53:06,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:06,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:06,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:53:06,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:53:06,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,790 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 189 [2025-03-04 10:53:06,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:06,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:53:06,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:53:06,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:53:06,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:53:06,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:53:06,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:53:06,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:53:06,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:53:06,819 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (1/1) ... [2025-03-04 10:53:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:06,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:53:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:53:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:53:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:53:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:53:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:53:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:53:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:53:06,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:53:06,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:53:07,455 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-04 10:53:07,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:53:07,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:53:07,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:53:07,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:07 BoogieIcfgContainer [2025-03-04 10:53:07,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:53:07,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:53:07,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:53:07,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:53:07,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:53:06" (1/3) ... [2025-03-04 10:53:07,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b441d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:07, skipping insertion in model container [2025-03-04 10:53:07,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:06" (2/3) ... [2025-03-04 10:53:07,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b441d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:07, skipping insertion in model container [2025-03-04 10:53:07,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:07" (3/3) ... [2025-03-04 10:53:07,475 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound100.c [2025-03-04 10:53:07,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:53:07,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_valuebound100.c that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 138 error locations. [2025-03-04 10:53:07,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:53:07,541 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;@3cd6d93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:53:07,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-04 10:53:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:53:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:07,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:07,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:07,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 312024932, now seen corresponding path program 1 times [2025-03-04 10:53:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-04 10:53:07,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:07,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:07,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:07,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-04 10:53:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107386209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137317442] [2025-03-04 10:53:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:53:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:53:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:53:07,672 INFO L87 Difference]: Start difference. First operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 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 10:53:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,712 INFO L93 Difference]: Finished difference Result 593 states and 636 transitions. [2025-03-04 10:53:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:53:07,714 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 10:53:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,720 INFO L225 Difference]: With dead ends: 593 [2025-03-04 10:53:07,720 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:53:07,724 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 10:53:07,728 INFO L435 NwaCegarLoop]: 304 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, 304 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:53:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 10:53:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 146 states have (on average 1.8972602739726028) internal successors, (277), 276 states have internal predecessors, (277), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:53:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 297 transitions. [2025-03-04 10:53:07,777 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 297 transitions. Word has length 5 [2025-03-04 10:53:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,777 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 297 transitions. [2025-03-04 10:53:07,778 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 10:53:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 297 transitions. [2025-03-04 10:53:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:07,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:53:07,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 312025893, now seen corresponding path program 1 times [2025-03-04 10:53:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307911065] [2025-03-04 10:53:07,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:07,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:07,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:07,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307911065] [2025-03-04 10:53:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307911065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055710618] [2025-03-04 10:53:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:07,825 INFO L87 Difference]: Start difference. First operand 288 states and 297 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,940 INFO L93 Difference]: Finished difference Result 556 states and 575 transitions. [2025-03-04 10:53:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:53:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,944 INFO L225 Difference]: With dead ends: 556 [2025-03-04 10:53:07,944 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 10:53:07,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:07,945 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 237 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 520 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 10:53:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 346. [2025-03-04 10:53:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 199 states have (on average 1.7989949748743719) internal successors, (358), 329 states have internal predecessors, (358), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:53:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2025-03-04 10:53:07,981 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 5 [2025-03-04 10:53:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,981 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2025-03-04 10:53:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2025-03-04 10:53:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:53:07,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:53:07,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -857936794, now seen corresponding path program 1 times [2025-03-04 10:53:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978366816] [2025-03-04 10:53:07,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:08,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:08,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385911787] [2025-03-04 10:53:08,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:08,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:08,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:53:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:08,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:08,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:08,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:08,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978366816] [2025-03-04 10:53:08,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385911787] [2025-03-04 10:53:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385911787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:08,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:08,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720411955] [2025-03-04 10:53:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:08,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:08,189 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,566 INFO L93 Difference]: Finished difference Result 506 states and 563 transitions. [2025-03-04 10:53:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:08,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 10:53:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,568 INFO L225 Difference]: With dead ends: 506 [2025-03-04 10:53:08,568 INFO L226 Difference]: Without dead ends: 451 [2025-03-04 10:53:08,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:08,569 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 267 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-04 10:53:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2025-03-04 10:53:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.6523297491039426) internal successors, (461), 409 states have internal predecessors, (461), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 501 transitions. [2025-03-04 10:53:08,592 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 501 transitions. Word has length 38 [2025-03-04 10:53:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,592 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 501 transitions. [2025-03-04 10:53:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 501 transitions. [2025-03-04 10:53:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:53:08,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,601 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 10:53:08,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:08,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:08,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:08,794 INFO L85 PathProgramCache]: Analyzing trace with hash 156468804, now seen corresponding path program 1 times [2025-03-04 10:53:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463517622] [2025-03-04 10:53:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:53:08,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:53:08,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463517622] [2025-03-04 10:53:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463517622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299166441] [2025-03-04 10:53:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:08,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:08,896 INFO L87 Difference]: Start difference. First operand 431 states and 501 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,103 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2025-03-04 10:53:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 10:53:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,105 INFO L225 Difference]: With dead ends: 464 [2025-03-04 10:53:09,105 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:09,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,106 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 425 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5698924731182795) internal successors, (438), 409 states have internal predecessors, (438), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 478 transitions. [2025-03-04 10:53:09,116 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 478 transitions. Word has length 40 [2025-03-04 10:53:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,116 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 478 transitions. [2025-03-04 10:53:09,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 478 transitions. [2025-03-04 10:53:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:53:09,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,117 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:53:09,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash 42672162, now seen corresponding path program 1 times [2025-03-04 10:53:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893871201] [2025-03-04 10:53:09,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:53:09,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:53:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893871201] [2025-03-04 10:53:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893871201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:09,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348815331] [2025-03-04 10:53:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:09,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:09,212 INFO L87 Difference]: Start difference. First operand 431 states and 478 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,485 INFO L93 Difference]: Finished difference Result 443 states and 485 transitions. [2025-03-04 10:53:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 10:53:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,488 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:09,488 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:09,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:09,488 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 367 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5627240143369177) internal successors, (436), 409 states have internal predecessors, (436), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 476 transitions. [2025-03-04 10:53:09,500 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 476 transitions. Word has length 42 [2025-03-04 10:53:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,502 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 476 transitions. [2025-03-04 10:53:09,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 476 transitions. [2025-03-04 10:53:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:53:09,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,503 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:53:09,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:09,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1322837233, now seen corresponding path program 1 times [2025-03-04 10:53:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174828125] [2025-03-04 10:53:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:53:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:53:09,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174828125] [2025-03-04 10:53:09,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174828125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:09,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:09,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985421581] [2025-03-04 10:53:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:09,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:09,572 INFO L87 Difference]: Start difference. First operand 431 states and 476 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:10,802 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2025-03-04 10:53:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-04 10:53:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:10,804 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:10,804 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:10,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:10,804 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 136 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:10,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 448 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 10:53:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5555555555555556) internal successors, (434), 409 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 474 transitions. [2025-03-04 10:53:10,820 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 474 transitions. Word has length 43 [2025-03-04 10:53:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,820 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 474 transitions. [2025-03-04 10:53:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 474 transitions. [2025-03-04 10:53:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:53:10,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:53:10,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:10,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1975692322, now seen corresponding path program 1 times [2025-03-04 10:53:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84394290] [2025-03-04 10:53:10,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:10,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:10,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824867160] [2025-03-04 10:53:10,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:53:10,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:10,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:10,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:11,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84394290] [2025-03-04 10:53:11,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824867160] [2025-03-04 10:53:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824867160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232821276] [2025-03-04 10:53:11,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:11,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:11,035 INFO L87 Difference]: Start difference. First operand 431 states and 474 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,337 INFO L93 Difference]: Finished difference Result 448 states and 481 transitions. [2025-03-04 10:53:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 10:53:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,339 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:53:11,339 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 10:53:11,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:11,340 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 257 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 10:53:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2025-03-04 10:53:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 412 states have internal predecessors, (431), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 471 transitions. [2025-03-04 10:53:11,350 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 471 transitions. Word has length 46 [2025-03-04 10:53:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,351 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 471 transitions. [2025-03-04 10:53:11,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 471 transitions. [2025-03-04 10:53:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:53:11,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:11,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:53:11,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1116919635, now seen corresponding path program 1 times [2025-03-04 10:53:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069979770] [2025-03-04 10:53:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:53:11,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:53:11,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069979770] [2025-03-04 10:53:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069979770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995318289] [2025-03-04 10:53:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:11,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:11,652 INFO L87 Difference]: Start difference. First operand 434 states and 471 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:12,034 INFO L93 Difference]: Finished difference Result 447 states and 472 transitions. [2025-03-04 10:53:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:53:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:12,036 INFO L225 Difference]: With dead ends: 447 [2025-03-04 10:53:12,036 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:12,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:12,037 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 132 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:12,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 384 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2025-03-04 10:53:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 412 states have internal predecessors, (425), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 465 transitions. [2025-03-04 10:53:12,047 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 465 transitions. Word has length 47 [2025-03-04 10:53:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:12,047 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 465 transitions. [2025-03-04 10:53:12,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 465 transitions. [2025-03-04 10:53:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:53:12,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:12,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:12,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:53:12,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2088594537, now seen corresponding path program 1 times [2025-03-04 10:53:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263609229] [2025-03-04 10:53:12,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:12,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:53:12,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:53:12,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263609229] [2025-03-04 10:53:12,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263609229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454899314] [2025-03-04 10:53:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:12,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:12,176 INFO L87 Difference]: Start difference. First operand 434 states and 465 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:12,501 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2025-03-04 10:53:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-04 10:53:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:12,503 INFO L225 Difference]: With dead ends: 445 [2025-03-04 10:53:12,503 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 10:53:12,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:12,504 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:12,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 269 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 10:53:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2025-03-04 10:53:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 219 states have (on average 1.6255707762557077) internal successors, (356), 349 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 390 transitions. [2025-03-04 10:53:12,515 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 390 transitions. Word has length 51 [2025-03-04 10:53:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 390 transitions. [2025-03-04 10:53:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 390 transitions. [2025-03-04 10:53:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 10:53:12,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:12,518 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:12,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:53:12,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:12,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1053201178, now seen corresponding path program 1 times [2025-03-04 10:53:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:12,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321231100] [2025-03-04 10:53:12,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 10:53:12,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 10:53:12,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321231100] [2025-03-04 10:53:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321231100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109601368] [2025-03-04 10:53:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:12,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:12,594 INFO L87 Difference]: Start difference. First operand 368 states and 390 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:12,806 INFO L93 Difference]: Finished difference Result 368 states and 390 transitions. [2025-03-04 10:53:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2025-03-04 10:53:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:12,807 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:12,807 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:12,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:12,808 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:12,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 155 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 342 states have internal predecessors, (349), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 383 transitions. [2025-03-04 10:53:12,816 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 383 transitions. Word has length 83 [2025-03-04 10:53:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:12,816 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 383 transitions. [2025-03-04 10:53:12,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 383 transitions. [2025-03-04 10:53:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 10:53:12,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:12,817 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:12,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:53:12,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:12,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1710501997, now seen corresponding path program 1 times [2025-03-04 10:53:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887951642] [2025-03-04 10:53:12,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:12,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 10:53:12,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:53:12,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:12,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887951642] [2025-03-04 10:53:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887951642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996693661] [2025-03-04 10:53:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:12,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:12,893 INFO L87 Difference]: Start difference. First operand 361 states and 383 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,077 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2025-03-04 10:53:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2025-03-04 10:53:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,078 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:13,079 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 10:53:13,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:13,079 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 392 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 10:53:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2025-03-04 10:53:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 221 states have (on average 1.588235294117647) internal successors, (351), 344 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 385 transitions. [2025-03-04 10:53:13,087 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 385 transitions. Word has length 84 [2025-03-04 10:53:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,087 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 385 transitions. [2025-03-04 10:53:13,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 385 transitions. [2025-03-04 10:53:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:13,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,088 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:53:13,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1214160528, now seen corresponding path program 1 times [2025-03-04 10:53:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630767271] [2025-03-04 10:53:13,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:13,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:13,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:13,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630767271] [2025-03-04 10:53:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630767271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546037372] [2025-03-04 10:53:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:13,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:13,151 INFO L87 Difference]: Start difference. First operand 363 states and 385 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,219 INFO L93 Difference]: Finished difference Result 363 states and 385 transitions. [2025-03-04 10:53:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:13,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-03-04 10:53:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,221 INFO L225 Difference]: With dead ends: 363 [2025-03-04 10:53:13,221 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:13,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:13,221 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 192 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 342 states have internal predecessors, (347), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 381 transitions. [2025-03-04 10:53:13,231 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 381 transitions. Word has length 86 [2025-03-04 10:53:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,231 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 381 transitions. [2025-03-04 10:53:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2025-03-04 10:53:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:53:13,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,233 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:53:13,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:13,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1485954615, now seen corresponding path program 1 times [2025-03-04 10:53:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963242985] [2025-03-04 10:53:13,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:13,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:13,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:13,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963242985] [2025-03-04 10:53:13,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963242985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420505428] [2025-03-04 10:53:13,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:13,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:13,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:53:13,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:13,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:13,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:13,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:13,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420505428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:53:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267265464] [2025-03-04 10:53:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:13,419 INFO L87 Difference]: Start difference. First operand 361 states and 381 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,520 INFO L93 Difference]: Finished difference Result 365 states and 381 transitions. [2025-03-04 10:53:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 10:53:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,522 INFO L225 Difference]: With dead ends: 365 [2025-03-04 10:53:13,522 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 10:53:13,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:13,522 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 258 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 394 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 10:53:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2025-03-04 10:53:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 334 states have internal predecessors, (339), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 373 transitions. [2025-03-04 10:53:13,533 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 373 transitions. Word has length 85 [2025-03-04 10:53:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,533 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 373 transitions. [2025-03-04 10:53:13,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 373 transitions. [2025-03-04 10:53:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:53:13,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,534 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:13,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1015729430, now seen corresponding path program 1 times [2025-03-04 10:53:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935149250] [2025-03-04 10:53:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:13,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:53:13,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:53:13,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935149250] [2025-03-04 10:53:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935149250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697195569] [2025-03-04 10:53:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:13,802 INFO L87 Difference]: Start difference. First operand 353 states and 373 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:13,925 INFO L93 Difference]: Finished difference Result 357 states and 373 transitions. [2025-03-04 10:53:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:13,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2025-03-04 10:53:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:13,927 INFO L225 Difference]: With dead ends: 357 [2025-03-04 10:53:13,927 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 10:53:13,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:13,928 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 48 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:13,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 700 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 10:53:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-04 10:53:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 219 states have (on average 1.5296803652968036) internal successors, (335), 332 states have internal predecessors, (335), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 369 transitions. [2025-03-04 10:53:13,937 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 369 transitions. Word has length 87 [2025-03-04 10:53:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:13,937 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 369 transitions. [2025-03-04 10:53:13,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 369 transitions. [2025-03-04 10:53:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:13,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:13,938 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:13,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:53:13,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:13,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1180046933, now seen corresponding path program 1 times [2025-03-04 10:53:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077288216] [2025-03-04 10:53:13,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:13,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:13,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:13,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077288216] [2025-03-04 10:53:13,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077288216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234899154] [2025-03-04 10:53:13,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:13,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:13,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:53:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:14,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:14,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:14,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234899154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:14,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:53:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198656409] [2025-03-04 10:53:14,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:14,218 INFO L87 Difference]: Start difference. First operand 351 states and 369 transitions. Second operand has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:14,364 INFO L93 Difference]: Finished difference Result 610 states and 648 transitions. [2025-03-04 10:53:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 86 [2025-03-04 10:53:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:14,367 INFO L225 Difference]: With dead ends: 610 [2025-03-04 10:53:14,367 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 10:53:14,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:14,367 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 467 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:14,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 743 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 10:53:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 409. [2025-03-04 10:53:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 278 states have (on average 1.5215827338129497) internal successors, (423), 385 states have internal predecessors, (423), 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 10:53:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 467 transitions. [2025-03-04 10:53:14,381 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 467 transitions. Word has length 86 [2025-03-04 10:53:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:14,381 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 467 transitions. [2025-03-04 10:53:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 467 transitions. [2025-03-04 10:53:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:53:14,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:14,382 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:14,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:14,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:53:14,587 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:14,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1503557041, now seen corresponding path program 1 times [2025-03-04 10:53:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028803319] [2025-03-04 10:53:14,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:14,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:14,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423106977] [2025-03-04 10:53:14,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:14,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:53:14,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:14,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:14,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028803319] [2025-03-04 10:53:14,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423106977] [2025-03-04 10:53:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423106977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:14,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:53:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735629217] [2025-03-04 10:53:14,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:14,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:14,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:14,878 INFO L87 Difference]: Start difference. First operand 409 states and 467 transitions. Second operand has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:15,032 INFO L93 Difference]: Finished difference Result 612 states and 644 transitions. [2025-03-04 10:53:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 97 [2025-03-04 10:53:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:15,035 INFO L225 Difference]: With dead ends: 612 [2025-03-04 10:53:15,035 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 10:53:15,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:15,035 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1094 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:15,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 784 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 10:53:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 414. [2025-03-04 10:53:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 286 states have (on average 1.479020979020979) internal successors, (423), 389 states have internal predecessors, (423), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:53:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 469 transitions. [2025-03-04 10:53:15,047 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 469 transitions. Word has length 97 [2025-03-04 10:53:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 469 transitions. [2025-03-04 10:53:15,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 469 transitions. [2025-03-04 10:53:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:53:15,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:15,048 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:15,054 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 10:53:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:53:15,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:15,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1039189943, now seen corresponding path program 1 times [2025-03-04 10:53:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213526427] [2025-03-04 10:53:15,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:15,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:15,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:15,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213526427] [2025-03-04 10:53:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213526427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:15,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:53:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794686231] [2025-03-04 10:53:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:15,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:15,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:15,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:15,404 INFO L87 Difference]: Start difference. First operand 414 states and 469 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:15,538 INFO L93 Difference]: Finished difference Result 420 states and 472 transitions. [2025-03-04 10:53:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2025-03-04 10:53:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:15,540 INFO L225 Difference]: With dead ends: 420 [2025-03-04 10:53:15,540 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 10:53:15,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:15,540 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 456 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:15,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 400 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 10:53:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 10:53:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 268 states have (on average 1.4962686567164178) internal successors, (401), 369 states have internal predecessors, (401), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 10:53:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 443 transitions. [2025-03-04 10:53:15,552 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 443 transitions. Word has length 103 [2025-03-04 10:53:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:15,553 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 443 transitions. [2025-03-04 10:53:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 443 transitions. [2025-03-04 10:53:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 10:53:15,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:15,553 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:53:15,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1503437932, now seen corresponding path program 1 times [2025-03-04 10:53:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341683274] [2025-03-04 10:53:15,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:15,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:15,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:15,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079589659] [2025-03-04 10:53:15,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:15,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:15,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:53:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:15,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:15,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341683274] [2025-03-04 10:53:15,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079589659] [2025-03-04 10:53:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079589659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:15,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:15,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473219636] [2025-03-04 10:53:15,962 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:15,963 INFO L87 Difference]: Start difference. First operand 392 states and 443 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:16,414 INFO L93 Difference]: Finished difference Result 518 states and 606 transitions. [2025-03-04 10:53:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2025-03-04 10:53:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:16,416 INFO L225 Difference]: With dead ends: 518 [2025-03-04 10:53:16,416 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 10:53:16,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:16,417 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:16,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 321 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 10:53:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 477. [2025-03-04 10:53:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 348 states have (on average 1.5) internal successors, (522), 449 states have internal predecessors, (522), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 574 transitions. [2025-03-04 10:53:16,429 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 574 transitions. Word has length 118 [2025-03-04 10:53:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 574 transitions. [2025-03-04 10:53:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 574 transitions. [2025-03-04 10:53:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 10:53:16,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:16,430 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:16,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:53:16,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:53:16,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash 638064583, now seen corresponding path program 1 times [2025-03-04 10:53:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:16,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361246313] [2025-03-04 10:53:16,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:16,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:16,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444367156] [2025-03-04 10:53:16,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:16,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:16,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:53:16,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:16,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:16,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:16,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:16,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:16,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361246313] [2025-03-04 10:53:21,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444367156] [2025-03-04 10:53:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444367156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:21,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902665170] [2025-03-04 10:53:21,197 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2025-03-04 10:53:21,198 INFO L87 Difference]: Start difference. First operand 477 states and 574 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:21,752 INFO L93 Difference]: Finished difference Result 509 states and 581 transitions. [2025-03-04 10:53:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 119 [2025-03-04 10:53:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:21,754 INFO L225 Difference]: With dead ends: 509 [2025-03-04 10:53:21,754 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 10:53:21,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2025-03-04 10:53:21,754 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 129 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:21,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 390 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 10:53:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 477. [2025-03-04 10:53:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 348 states have (on average 1.4540229885057472) internal successors, (506), 449 states have internal predecessors, (506), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 558 transitions. [2025-03-04 10:53:21,767 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 558 transitions. Word has length 119 [2025-03-04 10:53:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 558 transitions. [2025-03-04 10:53:21,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 558 transitions. [2025-03-04 10:53:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 10:53:21,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:21,768 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:21,775 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 10:53:21,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:21,973 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:21,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1694834190, now seen corresponding path program 1 times [2025-03-04 10:53:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:21,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040736496] [2025-03-04 10:53:21,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:21,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040736496] [2025-03-04 10:53:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040736496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744606254] [2025-03-04 10:53:22,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:22,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:22,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:53:22,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:22,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:22,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:22,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:22,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:22,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:22,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:22,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744606254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:22,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496479179] [2025-03-04 10:53:22,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:22,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:22,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:22,414 INFO L87 Difference]: Start difference. First operand 477 states and 558 transitions. Second operand has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:22,999 INFO L93 Difference]: Finished difference Result 493 states and 565 transitions. [2025-03-04 10:53:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 120 [2025-03-04 10:53:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:23,002 INFO L225 Difference]: With dead ends: 493 [2025-03-04 10:53:23,002 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 10:53:23,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:23,003 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 457 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:23,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 666 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 10:53:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 473. [2025-03-04 10:53:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 348 states have (on average 1.4281609195402298) internal successors, (497), 445 states have internal predecessors, (497), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 549 transitions. [2025-03-04 10:53:23,015 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 549 transitions. Word has length 120 [2025-03-04 10:53:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 549 transitions. [2025-03-04 10:53:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 549 transitions. [2025-03-04 10:53:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:53:23,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:23,017 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:23,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:23,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:23,217 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1000252123, now seen corresponding path program 1 times [2025-03-04 10:53:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078503061] [2025-03-04 10:53:23,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:23,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078503061] [2025-03-04 10:53:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078503061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202547906] [2025-03-04 10:53:23,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:23,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:23,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:23,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:53:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:23,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:23,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:23,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:23,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:23,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:23,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202547906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:23,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:23,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852185278] [2025-03-04 10:53:23,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:23,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:23,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:23,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:23,623 INFO L87 Difference]: Start difference. First operand 473 states and 549 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:23,987 INFO L93 Difference]: Finished difference Result 489 states and 556 transitions. [2025-03-04 10:53:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2025-03-04 10:53:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:23,989 INFO L225 Difference]: With dead ends: 489 [2025-03-04 10:53:23,989 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 10:53:23,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:23,989 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 454 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:23,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 409 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 10:53:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 469. [2025-03-04 10:53:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 348 states have (on average 1.4022988505747127) internal successors, (488), 441 states have internal predecessors, (488), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 540 transitions. [2025-03-04 10:53:24,001 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 540 transitions. Word has length 121 [2025-03-04 10:53:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:24,001 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 540 transitions. [2025-03-04 10:53:24,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 540 transitions. [2025-03-04 10:53:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 10:53:24,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:24,002 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:24,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:53:24,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:24,204 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -943044528, now seen corresponding path program 1 times [2025-03-04 10:53:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522078124] [2025-03-04 10:53:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:24,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:24,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:24,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747617856] [2025-03-04 10:53:24,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:24,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:24,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:53:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:24,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:24,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:24,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:24,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:24,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522078124] [2025-03-04 10:53:24,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747617856] [2025-03-04 10:53:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747617856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:24,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:24,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717837786] [2025-03-04 10:53:24,743 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:24,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:24,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:24,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:24,745 INFO L87 Difference]: Start difference. First operand 469 states and 540 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:25,252 INFO L93 Difference]: Finished difference Result 488 states and 547 transitions. [2025-03-04 10:53:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2025-03-04 10:53:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:25,256 INFO L225 Difference]: With dead ends: 488 [2025-03-04 10:53:25,256 INFO L226 Difference]: Without dead ends: 473 [2025-03-04 10:53:25,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:25,257 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 112 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:25,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 382 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-04 10:53:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2025-03-04 10:53:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 351 states have (on average 1.3646723646723646) internal successors, (479), 444 states have internal predecessors, (479), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 531 transitions. [2025-03-04 10:53:25,269 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 531 transitions. Word has length 122 [2025-03-04 10:53:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:25,269 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 531 transitions. [2025-03-04 10:53:25,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 531 transitions. [2025-03-04 10:53:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 10:53:25,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:25,270 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:25,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:25,470 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,SelfDestructingSolverStorable21 [2025-03-04 10:53:25,470 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 830390915, now seen corresponding path program 1 times [2025-03-04 10:53:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76258007] [2025-03-04 10:53:25,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:25,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:25,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:25,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76258007] [2025-03-04 10:53:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76258007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898316617] [2025-03-04 10:53:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:25,555 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:25,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:53:25,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:25,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:25,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:25,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898316617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:25,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2025-03-04 10:53:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342810161] [2025-03-04 10:53:25,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:25,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:25,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:25,868 INFO L87 Difference]: Start difference. First operand 472 states and 531 transitions. Second operand has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:26,667 INFO L93 Difference]: Finished difference Result 486 states and 532 transitions. [2025-03-04 10:53:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-04 10:53:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:26,669 INFO L225 Difference]: With dead ends: 486 [2025-03-04 10:53:26,669 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 10:53:26,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:26,670 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 393 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:26,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 576 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:53:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 10:53:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 472. [2025-03-04 10:53:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 351 states have (on average 1.358974358974359) internal successors, (477), 444 states have internal predecessors, (477), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 529 transitions. [2025-03-04 10:53:26,680 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 529 transitions. Word has length 123 [2025-03-04 10:53:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:26,680 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 529 transitions. [2025-03-04 10:53:26,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 529 transitions. [2025-03-04 10:53:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 10:53:26,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:26,682 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:26,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:26,883 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,SelfDestructingSolverStorable22 [2025-03-04 10:53:26,883 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash -135926465, now seen corresponding path program 1 times [2025-03-04 10:53:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874821149] [2025-03-04 10:53:26,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:26,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:26,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:26,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874821149] [2025-03-04 10:53:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874821149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474968367] [2025-03-04 10:53:26,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:26,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:26,981 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:26,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:53:27,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:27,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:27,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:27,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474968367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:27,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-04 10:53:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997254972] [2025-03-04 10:53:27,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:27,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:27,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:27,431 INFO L87 Difference]: Start difference. First operand 472 states and 529 transitions. Second operand has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:29,237 INFO L93 Difference]: Finished difference Result 472 states and 529 transitions. [2025-03-04 10:53:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:29,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-04 10:53:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:29,239 INFO L225 Difference]: With dead ends: 472 [2025-03-04 10:53:29,239 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 10:53:29,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:29,240 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 270 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:29,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 377 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 10:53:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 10:53:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-04 10:53:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 351 states have (on average 1.264957264957265) internal successors, (444), 416 states have internal predecessors, (444), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 496 transitions. [2025-03-04 10:53:29,258 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 496 transitions. Word has length 127 [2025-03-04 10:53:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:29,258 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 496 transitions. [2025-03-04 10:53:29,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 496 transitions. [2025-03-04 10:53:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 10:53:29,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:29,260 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:29,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:53:29,461 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,SelfDestructingSolverStorable23 [2025-03-04 10:53:29,461 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1929537541, now seen corresponding path program 1 times [2025-03-04 10:53:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:29,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977818068] [2025-03-04 10:53:29,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:29,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:29,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977818068] [2025-03-04 10:53:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977818068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372882304] [2025-03-04 10:53:29,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:29,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:29,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:29,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:29,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:53:29,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:29,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:29,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:29,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372882304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:42,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-04 10:53:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085736033] [2025-03-04 10:53:42,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:42,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:42,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:42,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=182, Unknown=2, NotChecked=0, Total=240 [2025-03-04 10:53:42,947 INFO L87 Difference]: Start difference. First operand 444 states and 496 transitions. Second operand has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:43,898 INFO L93 Difference]: Finished difference Result 444 states and 496 transitions. [2025-03-04 10:53:43,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2025-03-04 10:53:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:43,899 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:53:43,900 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 10:53:43,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=116, Invalid=302, Unknown=2, NotChecked=0, Total=420 [2025-03-04 10:53:43,901 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 241 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:43,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 409 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 10:53:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-03-04 10:53:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 323 states have (on average 1.2445820433436532) internal successors, (402), 378 states have internal predecessors, (402), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 450 transitions. [2025-03-04 10:53:43,914 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 450 transitions. Word has length 131 [2025-03-04 10:53:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 450 transitions. [2025-03-04 10:53:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 450 transitions. [2025-03-04 10:53:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:53:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:43,915 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:43,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:44,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:53:44,116 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1915178913, now seen corresponding path program 1 times [2025-03-04 10:53:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288847899] [2025-03-04 10:53:44,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:44,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 10:53:44,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:53:44,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:44,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 10:53:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288847899] [2025-03-04 10:53:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288847899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:44,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285598021] [2025-03-04 10:53:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:44,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:44,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:44,163 INFO L87 Difference]: Start difference. First operand 404 states and 450 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:44,353 INFO L93 Difference]: Finished difference Result 404 states and 450 transitions. [2025-03-04 10:53:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:44,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 160 [2025-03-04 10:53:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:44,356 INFO L225 Difference]: With dead ends: 404 [2025-03-04 10:53:44,356 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 10:53:44,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:44,356 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 268 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:44,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 180 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 10:53:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 10:53:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.238390092879257) internal successors, (400), 377 states have internal predecessors, (400), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 448 transitions. [2025-03-04 10:53:44,367 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 448 transitions. Word has length 160 [2025-03-04 10:53:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:44,367 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 448 transitions. [2025-03-04 10:53:44,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 448 transitions. [2025-03-04 10:53:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:53:44,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:44,368 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:44,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:53:44,368 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash -172302884, now seen corresponding path program 1 times [2025-03-04 10:53:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718397939] [2025-03-04 10:53:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:44,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:44,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976833030] [2025-03-04 10:53:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:44,393 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:44,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:53:44,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:44,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:44,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:44,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:44,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718397939] [2025-03-04 10:53:45,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976833030] [2025-03-04 10:53:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976833030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:45,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50258363] [2025-03-04 10:53:45,310 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:45,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:45,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:45,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:45,310 INFO L87 Difference]: Start difference. First operand 403 states and 448 transitions. Second operand has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:45,703 INFO L93 Difference]: Finished difference Result 405 states and 448 transitions. [2025-03-04 10:53:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 168 [2025-03-04 10:53:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:45,704 INFO L225 Difference]: With dead ends: 405 [2025-03-04 10:53:45,704 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 10:53:45,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:45,705 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:45,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 366 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 10:53:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 403. [2025-03-04 10:53:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2352941176470589) internal successors, (399), 377 states have internal predecessors, (399), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 447 transitions. [2025-03-04 10:53:45,713 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 447 transitions. Word has length 168 [2025-03-04 10:53:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 447 transitions. [2025-03-04 10:53:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.0) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 447 transitions. [2025-03-04 10:53:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 10:53:45,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:45,715 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:45,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:53:45,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:45,916 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1046421978, now seen corresponding path program 1 times [2025-03-04 10:53:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971755150] [2025-03-04 10:53:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:45,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:53:45,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:53:45,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248140261] [2025-03-04 10:53:45,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:45,942 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:45,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:53:45,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 10:53:45,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 10:53:45,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:45,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:45,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:46,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:46,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971755150] [2025-03-04 10:53:46,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:46,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248140261] [2025-03-04 10:53:46,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248140261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:46,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:46,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093411485] [2025-03-04 10:53:46,427 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:46,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:46,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:46,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:46,427 INFO L87 Difference]: Start difference. First operand 403 states and 447 transitions. Second operand has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:46,843 INFO L93 Difference]: Finished difference Result 415 states and 447 transitions. [2025-03-04 10:53:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 169 [2025-03-04 10:53:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:46,845 INFO L225 Difference]: With dead ends: 415 [2025-03-04 10:53:46,845 INFO L226 Difference]: Without dead ends: 414 [2025-03-04 10:53:46,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:46,845 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 119 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:46,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 438 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-04 10:53:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 403. [2025-03-04 10:53:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2321981424148607) internal successors, (398), 377 states have internal predecessors, (398), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 446 transitions. [2025-03-04 10:53:46,856 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 446 transitions. Word has length 169 [2025-03-04 10:53:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:46,856 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 446 transitions. [2025-03-04 10:53:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 446 transitions. [2025-03-04 10:53:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 10:53:46,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:46,857 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:46,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:47,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:53:47,058 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1084385192, now seen corresponding path program 1 times [2025-03-04 10:53:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510022177] [2025-03-04 10:53:47,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:47,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:47,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:47,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:47,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525538220] [2025-03-04 10:53:47,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:47,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:47,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:47,081 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:47,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:53:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:47,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:47,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:47,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:53:47,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:48,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510022177] [2025-03-04 10:53:48,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525538220] [2025-03-04 10:53:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525538220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:48,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 10:53:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114955562] [2025-03-04 10:53:48,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:48,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:48,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:48,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:48,644 INFO L87 Difference]: Start difference. First operand 403 states and 446 transitions. Second operand has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:50,226 INFO L93 Difference]: Finished difference Result 412 states and 446 transitions. [2025-03-04 10:53:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:53:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 172 [2025-03-04 10:53:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:50,228 INFO L225 Difference]: With dead ends: 412 [2025-03-04 10:53:50,228 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 10:53:50,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:53:50,228 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 619 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:50,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 277 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 10:53:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 10:53:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 403. [2025-03-04 10:53:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2074303405572755) internal successors, (390), 377 states have internal predecessors, (390), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 438 transitions. [2025-03-04 10:53:50,240 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 438 transitions. Word has length 172 [2025-03-04 10:53:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:50,241 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 438 transitions. [2025-03-04 10:53:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 438 transitions. [2025-03-04 10:53:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 10:53:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:50,242 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:50,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:50,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:53:50,443 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:50,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash -153949247, now seen corresponding path program 1 times [2025-03-04 10:53:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713715950] [2025-03-04 10:53:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:50,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:50,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:50,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036072012] [2025-03-04 10:53:50,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:50,469 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:50,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:53:50,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:50,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:50,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:53:50,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:51,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713715950] [2025-03-04 10:53:51,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036072012] [2025-03-04 10:53:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036072012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:51,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 10:53:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833847850] [2025-03-04 10:53:51,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:53:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:53:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:51,403 INFO L87 Difference]: Start difference. First operand 403 states and 438 transitions. Second operand has 14 states, 13 states have (on average 20.153846153846153) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-04 10:53:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:52,382 INFO L93 Difference]: Finished difference Result 477 states and 536 transitions. [2025-03-04 10:53:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:53:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 20.153846153846153) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 191 [2025-03-04 10:53:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:52,384 INFO L225 Difference]: With dead ends: 477 [2025-03-04 10:53:52,384 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 10:53:52,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:53:52,385 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 293 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:52,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 316 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 10:53:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2025-03-04 10:53:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.2219321148825066) internal successors, (468), 437 states have internal predecessors, (468), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 528 transitions. [2025-03-04 10:53:52,398 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 528 transitions. Word has length 191 [2025-03-04 10:53:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:52,398 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 528 transitions. [2025-03-04 10:53:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 20.153846153846153) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-04 10:53:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 528 transitions. [2025-03-04 10:53:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:53:52,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:52,399 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:52,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:52,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:52,601 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:52,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 14131833, now seen corresponding path program 1 times [2025-03-04 10:53:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651946606] [2025-03-04 10:53:52,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:52,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:52,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:52,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:52,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:52,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368277356] [2025-03-04 10:53:52,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:52,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:52,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:52,624 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:52,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:53:52,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:52,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:52,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:52,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:52,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651946606] [2025-03-04 10:53:52,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368277356] [2025-03-04 10:53:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368277356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:52,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357212701] [2025-03-04 10:53:52,853 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:52,853 INFO L87 Difference]: Start difference. First operand 469 states and 528 transitions. Second operand has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:52,961 INFO L93 Difference]: Finished difference Result 589 states and 621 transitions. [2025-03-04 10:53:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 192 [2025-03-04 10:53:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:52,963 INFO L225 Difference]: With dead ends: 589 [2025-03-04 10:53:52,963 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 10:53:52,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:52,963 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 287 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:52,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 727 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 10:53:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 469. [2025-03-04 10:53:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.2193211488250653) internal successors, (467), 437 states have internal predecessors, (467), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 527 transitions. [2025-03-04 10:53:52,976 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 527 transitions. Word has length 192 [2025-03-04 10:53:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 527 transitions. [2025-03-04 10:53:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 527 transitions. [2025-03-04 10:53:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-04 10:53:52,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:52,977 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:52,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:53:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:53,178 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1244043865, now seen corresponding path program 2 times [2025-03-04 10:53:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941223901] [2025-03-04 10:53:53,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:53,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:53:53,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:53:53,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:53,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379082355] [2025-03-04 10:53:53,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:53,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:53,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:53,198 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:53:53,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:53:53,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:53:53,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:53,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:53,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:53,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941223901] [2025-03-04 10:53:53,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379082355] [2025-03-04 10:53:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379082355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:53:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756577798] [2025-03-04 10:53:53,755 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:53,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:53,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:53,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:53,756 INFO L87 Difference]: Start difference. First operand 469 states and 527 transitions. Second operand has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:54,311 INFO L93 Difference]: Finished difference Result 553 states and 624 transitions. [2025-03-04 10:53:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 199 [2025-03-04 10:53:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:54,313 INFO L225 Difference]: With dead ends: 553 [2025-03-04 10:53:54,313 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 10:53:54,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:54,313 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 175 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:54,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 590 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 10:53:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 523. [2025-03-04 10:53:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 434 states have (on average 1.2188940092165899) internal successors, (529), 488 states have internal predecessors, (529), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:53:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 595 transitions. [2025-03-04 10:53:54,336 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 595 transitions. Word has length 199 [2025-03-04 10:53:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:54,337 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 595 transitions. [2025-03-04 10:53:54,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.833333333333332) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 595 transitions. [2025-03-04 10:53:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 10:53:54,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:54,338 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:54,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:54,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:54,542 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:54,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1525252919, now seen corresponding path program 2 times [2025-03-04 10:53:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32742466] [2025-03-04 10:53:54,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:54,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:53:54,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:53:54,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:54,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32742466] [2025-03-04 10:53:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32742466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595159554] [2025-03-04 10:53:54,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:54,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:54,665 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:54,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:53:54,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:53:54,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:53:54,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:54,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:54,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:55,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595159554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:55,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:53:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635299953] [2025-03-04 10:53:55,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:55,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:53:55,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:55,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:53:55,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:55,160 INFO L87 Difference]: Start difference. First operand 523 states and 595 transitions. Second operand has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:55,785 INFO L93 Difference]: Finished difference Result 578 states and 645 transitions. [2025-03-04 10:53:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 201 [2025-03-04 10:53:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:55,787 INFO L225 Difference]: With dead ends: 578 [2025-03-04 10:53:55,787 INFO L226 Difference]: Without dead ends: 577 [2025-03-04 10:53:55,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:53:55,788 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 646 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:55,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 564 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:53:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-04 10:53:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 556. [2025-03-04 10:53:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 464 states have (on average 1.2112068965517242) internal successors, (562), 518 states have internal predecessors, (562), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:53:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 634 transitions. [2025-03-04 10:53:55,803 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 634 transitions. Word has length 201 [2025-03-04 10:53:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:55,803 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 634 transitions. [2025-03-04 10:53:55,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 634 transitions. [2025-03-04 10:53:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:53:55,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:55,804 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:55,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:53:56,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:53:56,004 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 38200446, now seen corresponding path program 2 times [2025-03-04 10:53:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036555200] [2025-03-04 10:53:56,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:56,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:53:56,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:56,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:56,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074756799] [2025-03-04 10:53:56,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:56,022 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:53:56,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:53:56,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:56,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:56,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:53:56,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:56,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036555200] [2025-03-04 10:53:56,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074756799] [2025-03-04 10:53:56,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074756799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:56,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:53:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851157309] [2025-03-04 10:53:56,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:53:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:56,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:53:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:56,876 INFO L87 Difference]: Start difference. First operand 556 states and 634 transitions. Second operand has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:59,372 INFO L93 Difference]: Finished difference Result 599 states and 659 transitions. [2025-03-04 10:53:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:53:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 202 [2025-03-04 10:53:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:59,374 INFO L225 Difference]: With dead ends: 599 [2025-03-04 10:53:59,374 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 10:53:59,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:53:59,375 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 630 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:59,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1094 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 10:53:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 10:53:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 448. [2025-03-04 10:53:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 364 states have (on average 1.1978021978021978) internal successors, (436), 416 states have internal predecessors, (436), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 496 transitions. [2025-03-04 10:53:59,388 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 496 transitions. Word has length 202 [2025-03-04 10:53:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:59,388 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 496 transitions. [2025-03-04 10:53:59,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 496 transitions. [2025-03-04 10:53:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 10:53:59,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:59,389 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:59,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:53:59,590 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash 138330569, now seen corresponding path program 1 times [2025-03-04 10:53:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268044010] [2025-03-04 10:53:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:59,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 10:53:59,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 10:53:59,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:59,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-04 10:53:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268044010] [2025-03-04 10:53:59,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268044010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:59,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:59,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019517563] [2025-03-04 10:53:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:59,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:59,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:59,642 INFO L87 Difference]: Start difference. First operand 448 states and 496 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:59,811 INFO L93 Difference]: Finished difference Result 448 states and 496 transitions. [2025-03-04 10:53:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 244 [2025-03-04 10:53:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:59,813 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:53:59,813 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 10:53:59,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:59,813 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 119 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:59,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 144 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 10:53:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-03-04 10:53:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 364 states have (on average 1.1923076923076923) internal successors, (434), 415 states have internal predecessors, (434), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions. [2025-03-04 10:53:59,827 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 244 [2025-03-04 10:53:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions. [2025-03-04 10:53:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions. [2025-03-04 10:53:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 10:53:59,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:59,829 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:59,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 10:53:59,830 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1032234614, now seen corresponding path program 2 times [2025-03-04 10:53:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850512471] [2025-03-04 10:53:59,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:59,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:53:59,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:53:59,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:59,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811558164] [2025-03-04 10:53:59,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:59,857 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:59,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:53:59,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:53:59,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:53:59,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:59,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:00,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850512471] [2025-03-04 10:54:00,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811558164] [2025-03-04 10:54:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811558164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:00,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:54:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274452299] [2025-03-04 10:54:00,909 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:54:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:00,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:54:00,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:00,911 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 8 states, 7 states have (on average 24.428571428571427) internal successors, (171), 8 states have internal predecessors, (171), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 10:54:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:01,600 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions. [2025-03-04 10:54:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:01,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.428571428571427) internal successors, (171), 8 states have internal predecessors, (171), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 248 [2025-03-04 10:54:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:01,605 INFO L225 Difference]: With dead ends: 447 [2025-03-04 10:54:01,605 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 10:54:01,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:54:01,605 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 540 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:01,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 147 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:54:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 10:54:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-04 10:54:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1758241758241759) internal successors, (428), 412 states have internal predecessors, (428), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 488 transitions. [2025-03-04 10:54:01,620 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 488 transitions. Word has length 248 [2025-03-04 10:54:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 488 transitions. [2025-03-04 10:54:01,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.428571428571427) internal successors, (171), 8 states have internal predecessors, (171), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 10:54:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 488 transitions. [2025-03-04 10:54:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 10:54:01,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:01,622 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:01,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:54:01,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:01,824 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1934501832, now seen corresponding path program 2 times [2025-03-04 10:54:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111290509] [2025-03-04 10:54:01,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:01,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:54:01,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:54:01,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:01,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643236609] [2025-03-04 10:54:01,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:01,857 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:01,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:54:01,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:54:01,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:54:01,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:01,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:01,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:02,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111290509] [2025-03-04 10:54:02,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:02,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643236609] [2025-03-04 10:54:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643236609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:02,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:54:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201393559] [2025-03-04 10:54:02,504 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:02,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:54:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:02,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:54:02,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:02,504 INFO L87 Difference]: Start difference. First operand 444 states and 488 transitions. Second operand has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:54:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:02,834 INFO L93 Difference]: Finished difference Result 445 states and 488 transitions. [2025-03-04 10:54:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 249 [2025-03-04 10:54:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:02,836 INFO L225 Difference]: With dead ends: 445 [2025-03-04 10:54:02,836 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 10:54:02,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:02,836 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 92 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:02,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 953 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 10:54:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-04 10:54:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1730769230769231) internal successors, (427), 412 states have internal predecessors, (427), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 487 transitions. [2025-03-04 10:54:02,850 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 487 transitions. Word has length 249 [2025-03-04 10:54:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:02,850 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 487 transitions. [2025-03-04 10:54:02,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:54:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 487 transitions. [2025-03-04 10:54:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 10:54:02,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:02,851 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:02,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:03,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:03,056 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash -872772346, now seen corresponding path program 2 times [2025-03-04 10:54:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:03,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993948989] [2025-03-04 10:54:03,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:03,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:54:03,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:54:03,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:03,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737276862] [2025-03-04 10:54:03,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:03,079 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:03,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:54:03,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:54:03,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:54:03,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:03,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:03,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:54:03,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:03,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993948989] [2025-03-04 10:54:04,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737276862] [2025-03-04 10:54:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737276862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:04,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:54:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108389536] [2025-03-04 10:54:04,089 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:04,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:04,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:04,089 INFO L87 Difference]: Start difference. First operand 444 states and 487 transitions. Second operand has 11 states, 10 states have (on average 17.5) internal successors, (175), 11 states have internal predecessors, (175), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 10:54:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:04,952 INFO L93 Difference]: Finished difference Result 446 states and 487 transitions. [2025-03-04 10:54:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:54:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 17.5) internal successors, (175), 11 states have internal predecessors, (175), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 252 [2025-03-04 10:54:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:04,954 INFO L225 Difference]: With dead ends: 446 [2025-03-04 10:54:04,954 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 10:54:04,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:04,954 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 25 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:04,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 520 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:54:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 10:54:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-04 10:54:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1675824175824177) internal successors, (425), 412 states have internal predecessors, (425), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 485 transitions. [2025-03-04 10:54:04,968 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 485 transitions. Word has length 252 [2025-03-04 10:54:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:04,968 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 485 transitions. [2025-03-04 10:54:04,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 17.5) internal successors, (175), 11 states have internal predecessors, (175), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 10:54:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 485 transitions. [2025-03-04 10:54:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-04 10:54:04,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:04,969 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:04,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:05,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:54:05,169 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:05,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1286138828, now seen corresponding path program 1 times [2025-03-04 10:54:05,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:05,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493990056] [2025-03-04 10:54:05,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:05,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-04 10:54:05,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-04 10:54:05,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:05,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145961152] [2025-03-04 10:54:05,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:05,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:05,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:05,189 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:05,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:54:05,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-04 10:54:05,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-04 10:54:05,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:05,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:05,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:54:05,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:05,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493990056] [2025-03-04 10:54:06,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145961152] [2025-03-04 10:54:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145961152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:06,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:54:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429875496] [2025-03-04 10:54:06,056 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:06,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:06,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:06,057 INFO L87 Difference]: Start difference. First operand 444 states and 485 transitions. Second operand has 11 states, 10 states have (on average 17.6) internal successors, (176), 11 states have internal predecessors, (176), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:54:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:06,881 INFO L93 Difference]: Finished difference Result 448 states and 485 transitions. [2025-03-04 10:54:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:54:06,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 17.6) internal successors, (176), 11 states have internal predecessors, (176), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 253 [2025-03-04 10:54:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:06,883 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:54:06,883 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 10:54:06,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:06,883 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 54 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:06,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 448 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:54:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 10:54:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-04 10:54:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1565934065934067) internal successors, (421), 412 states have internal predecessors, (421), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 481 transitions. [2025-03-04 10:54:06,897 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 481 transitions. Word has length 253 [2025-03-04 10:54:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 481 transitions. [2025-03-04 10:54:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 17.6) internal successors, (176), 11 states have internal predecessors, (176), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:54:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 481 transitions. [2025-03-04 10:54:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-04 10:54:06,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:06,899 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:54:06,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:07,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:54:07,099 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:07,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1808710063, now seen corresponding path program 1 times [2025-03-04 10:54:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132116691] [2025-03-04 10:54:07,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:54:07,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:54:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555803202] [2025-03-04 10:54:07,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:07,123 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:07,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:54:07,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:54:07,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:54:07,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:07,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:07,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:07,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:54:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132116691] [2025-03-04 10:54:07,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555803202] [2025-03-04 10:54:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555803202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:07,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:54:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621435] [2025-03-04 10:54:07,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:07,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:07,588 INFO L87 Difference]: Start difference. First operand 444 states and 481 transitions. Second operand has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,822 INFO L93 Difference]: Finished difference Result 639 states and 680 transitions. [2025-03-04 10:54:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 261 [2025-03-04 10:54:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,824 INFO L225 Difference]: With dead ends: 639 [2025-03-04 10:54:07,824 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 10:54:07,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:07,824 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 902 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1468 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 10:54:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 443. [2025-03-04 10:54:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 364 states have (on average 1.1483516483516483) internal successors, (418), 411 states have internal predecessors, (418), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 478 transitions. [2025-03-04 10:54:07,838 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 478 transitions. Word has length 261 [2025-03-04 10:54:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,838 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 478 transitions. [2025-03-04 10:54:07,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 40.22222222222222) internal successors, (362), 10 states have internal predecessors, (362), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:54:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 478 transitions. [2025-03-04 10:54:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-04 10:54:07,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:08,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:54:08,040 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:08,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash -467902870, now seen corresponding path program 1 times [2025-03-04 10:54:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:08,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747136034] [2025-03-04 10:54:08,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:08,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 10:54:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 10:54:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747136034] [2025-03-04 10:54:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747136034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94685671] [2025-03-04 10:54:08,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:08,220 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:08,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:54:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-04 10:54:08,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-04 10:54:08,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:54:08,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 52 proven. 112 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:08,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94685671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:08,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:54:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061797092] [2025-03-04 10:54:08,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:08,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:54:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:08,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:54:08,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:54:08,820 INFO L87 Difference]: Start difference. First operand 443 states and 478 transitions. Second operand has 16 states, 15 states have (on average 24.933333333333334) internal successors, (374), 16 states have internal predecessors, (374), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,205 INFO L93 Difference]: Finished difference Result 443 states and 478 transitions. [2025-03-04 10:54:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:54:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 24.933333333333334) internal successors, (374), 16 states have internal predecessors, (374), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 272 [2025-03-04 10:54:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,206 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:54:10,206 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:54:10,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:54:10,207 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 632 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 368 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 10:54:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:54:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-04 10:54:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 364 states have (on average 1.14010989010989) internal successors, (415), 409 states have internal predecessors, (415), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 475 transitions. [2025-03-04 10:54:10,222 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 475 transitions. Word has length 272 [2025-03-04 10:54:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,223 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 475 transitions. [2025-03-04 10:54:10,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 24.933333333333334) internal successors, (374), 16 states have internal predecessors, (374), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 475 transitions. [2025-03-04 10:54:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 10:54:10,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,224 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:10,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:54:10,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:10,424 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2125434353, now seen corresponding path program 1 times [2025-03-04 10:54:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051428762] [2025-03-04 10:54:10,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 10:54:10,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:54:10,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051428762] [2025-03-04 10:54:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051428762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715739193] [2025-03-04 10:54:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:10,524 INFO L87 Difference]: Start difference. First operand 441 states and 475 transitions. Second operand has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:54:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,964 INFO L93 Difference]: Finished difference Result 441 states and 475 transitions. [2025-03-04 10:54:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 275 [2025-03-04 10:54:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,965 INFO L225 Difference]: With dead ends: 441 [2025-03-04 10:54:10,965 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 10:54:10,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:54:10,966 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 181 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 378 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 10:54:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-04 10:54:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 364 states have (on average 1.129120879120879) internal successors, (411), 407 states have internal predecessors, (411), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 471 transitions. [2025-03-04 10:54:10,982 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 471 transitions. Word has length 275 [2025-03-04 10:54:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,983 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 471 transitions. [2025-03-04 10:54:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:54:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 471 transitions. [2025-03-04 10:54:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 10:54:10,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,984 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 10:54:10,984 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1463955418, now seen corresponding path program 1 times [2025-03-04 10:54:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671309831] [2025-03-04 10:54:10,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 10:54:10,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:10,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671309831] [2025-03-04 10:54:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671309831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681438324] [2025-03-04 10:54:11,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:11,169 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:54:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 10:54:11,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:54:11,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:54:11,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681438324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:12,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:54:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892083139] [2025-03-04 10:54:12,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:12,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:54:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:12,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:54:12,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:54:12,678 INFO L87 Difference]: Start difference. First operand 439 states and 471 transitions. Second operand has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:14,756 INFO L93 Difference]: Finished difference Result 439 states and 471 transitions. [2025-03-04 10:54:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 276 [2025-03-04 10:54:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:14,758 INFO L225 Difference]: With dead ends: 439 [2025-03-04 10:54:14,758 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 10:54:14,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:54:14,759 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 762 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:14,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 425 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 10:54:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 10:54:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 10:54:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 332 states have (on average 1.1295180722891567) internal successors, (375), 373 states have internal predecessors, (375), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:54:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 431 transitions. [2025-03-04 10:54:14,773 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 431 transitions. Word has length 276 [2025-03-04 10:54:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:14,773 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 431 transitions. [2025-03-04 10:54:14,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 25.466666666666665) internal successors, (382), 16 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 431 transitions. [2025-03-04 10:54:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 10:54:14,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:14,774 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:54:14,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 10:54:14,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:14,975 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:54:14,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 623126763, now seen corresponding path program 3 times [2025-03-04 10:54:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:14,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843267681] [2025-03-04 10:54:14,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:14,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 8 equivalence classes. [2025-03-04 10:54:15,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 10:54:15,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:54:15,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:15,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028524638] [2025-03-04 10:54:15,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:15,011 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:15,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:54:15,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 8 equivalence classes. [2025-03-04 10:54:15,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 92 of 279 statements. [2025-03-04 10:54:15,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:54:15,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:15,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:54:15,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 146 proven. 94 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2025-03-04 10:54:21,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843267681] [2025-03-04 10:54:28,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028524638] [2025-03-04 10:54:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028524638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:28,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 10:54:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017169495] [2025-03-04 10:54:28,874 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:28,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:54:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:28,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:54:28,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=444, Unknown=2, NotChecked=0, Total=552 [2025-03-04 10:54:28,875 INFO L87 Difference]: Start difference. First operand 403 states and 431 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9)