./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound100.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/hard-ll_unwindbound100.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 efc4103a673d30f5c3fd98741c7d56d84f1ec5a0e9e3b77a4d9f9d9493ec5192 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:09:51,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:09:51,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:09:51,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:09:51,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:09:51,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:09:51,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:09:51,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:09:51,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:09:51,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:09:51,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:09:51,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:09:51,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:09:51,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:09:51,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:09:51,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:09:51,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:09:51,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:09:51,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:09:51,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:09:51,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:09:51,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:09:51,389 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 -> efc4103a673d30f5c3fd98741c7d56d84f1ec5a0e9e3b77a4d9f9d9493ec5192 [2025-03-04 11:09:51,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:09:51,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:09:51,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:09:51,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:09:51,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:09:51,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound100.c [2025-03-04 11:09:52,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4cde2aa/7747bfc935324dfa91d30163e4eaeda3/FLAG47ca839df [2025-03-04 11:09:52,852 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:09:52,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound100.c [2025-03-04 11:09:52,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4cde2aa/7747bfc935324dfa91d30163e4eaeda3/FLAG47ca839df [2025-03-04 11:09:53,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4cde2aa/7747bfc935324dfa91d30163e4eaeda3 [2025-03-04 11:09:53,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:09:53,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:09:53,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:09:53,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:09:53,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:09:53,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36055fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53, skipping insertion in model container [2025-03-04 11:09:53,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:09:53,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:09:53,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:09:53,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:09:53,420 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:09:53,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53 WrapperNode [2025-03-04 11:09:53,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:09:53,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:09:53,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:09:53,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:09:53,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,452 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-03-04 11:09:53,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:09:53,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:09:53,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:09:53,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:09:53,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:09:53,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:09:53,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:09:53,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:09:53,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:09:53,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (1/1) ... [2025-03-04 11:09:53,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:09:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:53,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:09:53,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:09:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:09:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:09:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:09:53,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:09:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:09:53,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:09:53,559 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:09:53,560 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:09:53,776 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-04 11:09:53,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:09:53,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:09:53,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:09:53,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:09:53 BoogieIcfgContainer [2025-03-04 11:09:53,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:09:53,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:09:53,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:09:53,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:09:53,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:09:53" (1/3) ... [2025-03-04 11:09:53,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4295c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:09:53, skipping insertion in model container [2025-03-04 11:09:53,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:09:53" (2/3) ... [2025-03-04 11:09:53,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4295c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:09:53, skipping insertion in model container [2025-03-04 11:09:53,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:09:53" (3/3) ... [2025-03-04 11:09:53,798 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound100.c [2025-03-04 11:09:53,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:09:53,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound100.c that has 2 procedures, 84 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-03-04 11:09:53,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:09:53,868 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;@3220541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:09:53,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 11:09:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:09:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:09:53,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:53,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:09:53,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:53,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash -923470242, now seen corresponding path program 1 times [2025-03-04 11:09:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585102014] [2025-03-04 11:09:53,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:53,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:09:53,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:09:53,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:53,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:09:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:53,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585102014] [2025-03-04 11:09:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585102014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636158459] [2025-03-04 11:09:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:53,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:09:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:53,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:09:53,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:09:53,993 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,009 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2025-03-04 11:09:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:09:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:09:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,015 INFO L225 Difference]: With dead ends: 164 [2025-03-04 11:09:54,015 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:09:54,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:09:54,020 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:09:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 11:09:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:09:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-03-04 11:09:54,048 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 6 [2025-03-04 11:09:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-03-04 11:09:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-03-04 11:09:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:09:54,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:09:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:09:54,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash -923440451, now seen corresponding path program 1 times [2025-03-04 11:09:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418119679] [2025-03-04 11:09:54,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:09:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:09:54,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:09:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418119679] [2025-03-04 11:09:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418119679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640134527] [2025-03-04 11:09:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:54,100 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,150 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-03-04 11:09:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:09:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:09:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,152 INFO L225 Difference]: With dead ends: 85 [2025-03-04 11:09:54,153 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 11:09:54,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:54,153 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 11:09:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2025-03-04 11:09:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:09:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-03-04 11:09:54,164 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 6 [2025-03-04 11:09:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,164 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-03-04 11:09:54,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-03-04 11:09:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:09:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:54,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:09:54,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1438117135, now seen corresponding path program 1 times [2025-03-04 11:09:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182571170] [2025-03-04 11:09:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:09:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:09:54,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:09:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182571170] [2025-03-04 11:09:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182571170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210456585] [2025-03-04 11:09:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:54,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:54,219 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,250 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2025-03-04 11:09:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:09:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:09:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,256 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:09:54,256 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 11:09:54,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:54,256 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 229 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 11:09:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 11:09:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:09:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-03-04 11:09:54,266 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 7 [2025-03-04 11:09:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-03-04 11:09:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:09:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-03-04 11:09:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:09:54,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:54,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:09:54,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,267 INFO L85 PathProgramCache]: Analyzing trace with hash 981987439, now seen corresponding path program 1 times [2025-03-04 11:09:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806560206] [2025-03-04 11:09:54,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:09:54,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:09:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384629679] [2025-03-04 11:09:54,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:54,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:09:54,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:09:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:09:54,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:09:54,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:09:54,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:09:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806560206] [2025-03-04 11:09:54,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384629679] [2025-03-04 11:09:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384629679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907564619] [2025-03-04 11:09:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:09:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:09:54,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,361 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:09:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,415 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2025-03-04 11:09:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:09:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 11:09:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,416 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:09:54,416 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 11:09:54,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,417 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 11:09:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2025-03-04 11:09:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 93 states have internal predecessors, (108), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:09:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2025-03-04 11:09:54,426 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 19 [2025-03-04 11:09:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,426 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2025-03-04 11:09:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:09:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2025-03-04 11:09:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:09:54,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:54,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:09:54,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:54,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1314812425, now seen corresponding path program 1 times [2025-03-04 11:09:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977744406] [2025-03-04 11:09:54,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:09:54,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:09:54,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977744406] [2025-03-04 11:09:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977744406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926291118] [2025-03-04 11:09:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:09:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:09:54,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,712 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,743 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-03-04 11:09:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:09:54,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-04 11:09:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,744 INFO L225 Difference]: With dead ends: 106 [2025-03-04 11:09:54,744 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:09:54,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,745 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 70 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:09:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 11:09:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 91 states have internal predecessors, (105), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:09:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-04 11:09:54,755 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 27 [2025-03-04 11:09:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-04 11:09:54,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-04 11:09:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:09:54,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,759 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] [2025-03-04 11:09:54,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:09:54,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2104479482, now seen corresponding path program 1 times [2025-03-04 11:09:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942864631] [2025-03-04 11:09:54,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:09:54,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:09:54,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:54,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942864631] [2025-03-04 11:09:54,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942864631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:54,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887146011] [2025-03-04 11:09:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:09:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:09:54,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,840 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:54,880 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2025-03-04 11:09:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:09:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 28 [2025-03-04 11:09:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:54,882 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:09:54,882 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 11:09:54,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:54,882 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:54,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 11:09:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2025-03-04 11:09:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 91 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:09:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-03-04 11:09:54,889 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 28 [2025-03-04 11:09:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:54,889 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-03-04 11:09:54,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-03-04 11:09:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:09:54,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:54,890 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] [2025-03-04 11:09:54,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:09:54,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2104480699, now seen corresponding path program 1 times [2025-03-04 11:09:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248196678] [2025-03-04 11:09:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:54,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:09:54,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:09:54,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:54,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248196678] [2025-03-04 11:09:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248196678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:54,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:09:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90662737] [2025-03-04 11:09:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:54,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:09:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:54,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:09:54,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:09:54,962 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:55,025 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-03-04 11:09:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:09:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 28 [2025-03-04 11:09:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:55,026 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:09:55,026 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 11:09:55,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:09:55,027 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:55,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 205 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 11:09:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 11:09:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:09:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2025-03-04 11:09:55,033 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 28 [2025-03-04 11:09:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:55,033 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2025-03-04 11:09:55,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2025-03-04 11:09:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:09:55,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:55,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:55,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:09:55,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:55,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -814392210, now seen corresponding path program 1 times [2025-03-04 11:09:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673077678] [2025-03-04 11:09:55,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:09:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:09:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:55,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:55,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673077678] [2025-03-04 11:09:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673077678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:09:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083368829] [2025-03-04 11:09:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:55,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:09:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:55,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:09:55,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:09:55,106 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:55,165 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-03-04 11:09:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:09:55,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-03-04 11:09:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:55,166 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:09:55,166 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:09:55,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:09:55,166 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:55,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 294 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:09:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-03-04 11:09:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 93 states have internal predecessors, (103), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:09:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2025-03-04 11:09:55,176 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 29 [2025-03-04 11:09:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:55,176 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2025-03-04 11:09:55,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2025-03-04 11:09:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:09:55,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:55,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:55,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:09:55,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -946865396, now seen corresponding path program 1 times [2025-03-04 11:09:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712136809] [2025-03-04 11:09:55,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:09:55,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:09:55,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:55,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046193713] [2025-03-04 11:09:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:55,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:55,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:55,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:55,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:09:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:09:55,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:09:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:55,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:09:55,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:55,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:09:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712136809] [2025-03-04 11:09:55,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046193713] [2025-03-04 11:09:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046193713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:55,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:09:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339820169] [2025-03-04 11:09:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:55,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:09:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:55,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:09:55,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:55,262 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:55,307 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2025-03-04 11:09:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:09:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 11:09:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:55,308 INFO L225 Difference]: With dead ends: 145 [2025-03-04 11:09:55,308 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 11:09:55,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:09:55,309 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:55,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 11:09:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2025-03-04 11:09:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 111 states have internal predecessors, (130), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:09:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2025-03-04 11:09:55,316 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 31 [2025-03-04 11:09:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:55,317 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2025-03-04 11:09:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2025-03-04 11:09:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:09:55,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:55,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:55,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:09:55,518 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,SelfDestructingSolverStorable8 [2025-03-04 11:09:55,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1085019274, now seen corresponding path program 1 times [2025-03-04 11:09:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354783937] [2025-03-04 11:09:55,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:09:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:09:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354783937] [2025-03-04 11:09:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354783937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:09:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959224184] [2025-03-04 11:09:55,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:55,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:55,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:09:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:09:55,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:09:55,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:55,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:55,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:09:55,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:55,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:09:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959224184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:09:55,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:09:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2025-03-04 11:09:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47688566] [2025-03-04 11:09:55,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:09:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:09:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:09:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:09:55,768 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:09:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:55,889 INFO L93 Difference]: Finished difference Result 253 states and 306 transitions. [2025-03-04 11:09:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:09:55,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 33 [2025-03-04 11:09:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:55,891 INFO L225 Difference]: With dead ends: 253 [2025-03-04 11:09:55,891 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 11:09:55,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:09:55,892 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:55,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 11:09:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2025-03-04 11:09:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 142 states have internal predecessors, (174), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:09:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2025-03-04 11:09:55,905 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 33 [2025-03-04 11:09:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2025-03-04 11:09:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:09:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2025-03-04 11:09:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:09:55,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:55,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:55,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:09:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:56,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 595421610, now seen corresponding path program 1 times [2025-03-04 11:09:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982195632] [2025-03-04 11:09:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:09:56,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:09:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982195632] [2025-03-04 11:09:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982195632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:09:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410459347] [2025-03-04 11:09:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:56,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:56,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:56,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:56,164 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:56,365 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2025-03-04 11:09:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:09:56,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (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 33 [2025-03-04 11:09:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:56,366 INFO L225 Difference]: With dead ends: 190 [2025-03-04 11:09:56,366 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 11:09:56,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:56,367 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:56,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 113 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:09:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 11:09:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2025-03-04 11:09:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4523809523809523) internal successors, (183), 149 states have internal predecessors, (183), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:09:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2025-03-04 11:09:56,383 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 33 [2025-03-04 11:09:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:56,383 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 219 transitions. [2025-03-04 11:09:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 219 transitions. [2025-03-04 11:09:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:09:56,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:56,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:56,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:09:56,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:56,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1278200735, now seen corresponding path program 1 times [2025-03-04 11:09:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432709012] [2025-03-04 11:09:56,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:56,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:09:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:09:56,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:56,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785036240] [2025-03-04 11:09:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:56,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:56,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:09:56,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:09:56,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:09:56,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:56,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:56,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:09:56,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:09:56,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:09:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:56,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432709012] [2025-03-04 11:09:56,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:56,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785036240] [2025-03-04 11:09:56,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785036240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:56,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:56,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:09:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56165202] [2025-03-04 11:09:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:56,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:56,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:56,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:56,545 INFO L87 Difference]: Start difference. First operand 173 states and 219 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:56,665 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2025-03-04 11:09:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:09:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (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 34 [2025-03-04 11:09:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:56,668 INFO L225 Difference]: With dead ends: 179 [2025-03-04 11:09:56,669 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 11:09:56,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:56,669 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:56,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 11:09:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-04 11:09:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 129 states have (on average 1.434108527131783) internal successors, (185), 152 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:09:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2025-03-04 11:09:56,684 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 34 [2025-03-04 11:09:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2025-03-04 11:09:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:09:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2025-03-04 11:09:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:09:56,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:56,684 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:56,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:09:56,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:56,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash -429017238, now seen corresponding path program 1 times [2025-03-04 11:09:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209822709] [2025-03-04 11:09:56,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:56,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:09:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:09:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401681872] [2025-03-04 11:09:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:56,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:56,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:56,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:09:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:09:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:09:56,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:56,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:56,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:09:56,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:09:56,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:09:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209822709] [2025-03-04 11:09:56,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401681872] [2025-03-04 11:09:56,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401681872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:56,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:09:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369790257] [2025-03-04 11:09:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:56,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:56,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:56,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:56,984 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:09:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:57,040 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2025-03-04 11:09:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:09:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-04 11:09:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:57,042 INFO L225 Difference]: With dead ends: 213 [2025-03-04 11:09:57,043 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 11:09:57,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:57,043 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:57,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:09:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 11:09:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2025-03-04 11:09:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 159 states have internal predecessors, (190), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:09:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2025-03-04 11:09:57,058 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 45 [2025-03-04 11:09:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2025-03-04 11:09:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:09:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2025-03-04 11:09:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:09:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:57,059 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:57,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:09:57,259 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,SelfDestructingSolverStorable12 [2025-03-04 11:09:57,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -414632454, now seen corresponding path program 1 times [2025-03-04 11:09:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198727366] [2025-03-04 11:09:57,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:57,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:09:57,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:09:57,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:57,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:57,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117054430] [2025-03-04 11:09:57,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:57,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:57,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:09:57,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:09:57,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:09:57,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:57,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:57,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:09:57,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:09:57,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:09:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198727366] [2025-03-04 11:09:57,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117054430] [2025-03-04 11:09:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117054430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:09:57,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:09:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-04 11:09:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117226398] [2025-03-04 11:09:57,412 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:09:57,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:57,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:57,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:57,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:57,412 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:09:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:57,481 INFO L93 Difference]: Finished difference Result 281 states and 347 transitions. [2025-03-04 11:09:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:09:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-04 11:09:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:57,482 INFO L225 Difference]: With dead ends: 281 [2025-03-04 11:09:57,482 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 11:09:57,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 11:09:57,483 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:57,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 11:09:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2025-03-04 11:09:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.3814432989690721) internal successors, (268), 213 states have internal predecessors, (268), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 11:09:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 320 transitions. [2025-03-04 11:09:57,502 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 320 transitions. Word has length 46 [2025-03-04 11:09:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:57,502 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 320 transitions. [2025-03-04 11:09:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:09:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 320 transitions. [2025-03-04 11:09:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:09:57,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:57,503 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] [2025-03-04 11:09:57,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:09:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:57,703 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1222822311, now seen corresponding path program 1 times [2025-03-04 11:09:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959765380] [2025-03-04 11:09:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:57,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:09:57,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:09:57,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:57,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:09:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959765380] [2025-03-04 11:09:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959765380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:09:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:09:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:09:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377759329] [2025-03-04 11:09:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:09:57,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:09:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:57,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:09:57,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:09:57,752 INFO L87 Difference]: Start difference. First operand 245 states and 320 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:09:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:57,857 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2025-03-04 11:09:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:09:57,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 50 [2025-03-04 11:09:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:57,858 INFO L225 Difference]: With dead ends: 256 [2025-03-04 11:09:57,858 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 11:09:57,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:09:57,859 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:57,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 11:09:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2025-03-04 11:09:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 200 states have internal predecessors, (254), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 11:09:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2025-03-04 11:09:57,872 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 50 [2025-03-04 11:09:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:57,872 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2025-03-04 11:09:57,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:09:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2025-03-04 11:09:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:09:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:57,873 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:09:57,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1177873301, now seen corresponding path program 1 times [2025-03-04 11:09:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-03-04 11:09:57,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:57,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:09:57,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:09:57,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:57,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-03-04 11:09:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067773448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:09:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129650700] [2025-03-04 11:09:57,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:57,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:57,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:57,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:57,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:09:57,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:09:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:09:57,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:57,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:09:57,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:57,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:09:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129650700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:09:58,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:09:58,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 11:09:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284973553] [2025-03-04 11:09:58,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:09:58,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:09:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:58,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:09:58,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:09:58,047 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 11:09:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:58,181 INFO L93 Difference]: Finished difference Result 364 states and 468 transitions. [2025-03-04 11:09:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:09:58,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 54 [2025-03-04 11:09:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:58,183 INFO L225 Difference]: With dead ends: 364 [2025-03-04 11:09:58,183 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 11:09:58,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:09:58,184 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 127 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:58,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 252 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 11:09:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 299. [2025-03-04 11:09:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 241 states have (on average 1.4190871369294606) internal successors, (342), 260 states have internal predecessors, (342), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:09:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 408 transitions. [2025-03-04 11:09:58,203 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 408 transitions. Word has length 54 [2025-03-04 11:09:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:58,203 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 408 transitions. [2025-03-04 11:09:58,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 11:09:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 408 transitions. [2025-03-04 11:09:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:09:58,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:58,204 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:58,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:09:58,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:58,408 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2140595625, now seen corresponding path program 1 times [2025-03-04 11:09:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813245000] [2025-03-04 11:09:58,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:58,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:09:58,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:09:58,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:58,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813245000] [2025-03-04 11:09:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813245000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:09:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122663280] [2025-03-04 11:09:58,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:58,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:58,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:58,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:09:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:09:58,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:09:58,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:58,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:58,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:09:58,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:09:58,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:09:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122663280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:09:58,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:09:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-03-04 11:09:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073381535] [2025-03-04 11:09:58,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:09:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:09:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:09:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:09:58,708 INFO L87 Difference]: Start difference. First operand 299 states and 408 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:09:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:58,904 INFO L93 Difference]: Finished difference Result 346 states and 451 transitions. [2025-03-04 11:09:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:09:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 55 [2025-03-04 11:09:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:58,906 INFO L225 Difference]: With dead ends: 346 [2025-03-04 11:09:58,906 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 11:09:58,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:09:58,907 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 104 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:58,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 552 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:09:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 11:09:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2025-03-04 11:09:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 262 states have (on average 1.3931297709923665) internal successors, (365), 281 states have internal predecessors, (365), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:09:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2025-03-04 11:09:58,927 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 55 [2025-03-04 11:09:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2025-03-04 11:09:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:09:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2025-03-04 11:09:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 11:09:58,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:58,928 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:58,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:09:59,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:09:59,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:09:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:09:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1253454012, now seen corresponding path program 1 times [2025-03-04 11:09:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:09:59,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502068239] [2025-03-04 11:09:59,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:09:59,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:09:59,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:09:59,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:59,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:09:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527631553] [2025-03-04 11:09:59,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:09:59,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:09:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:09:59,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:09:59,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:09:59,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:09:59,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:09:59,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:09:59,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:09:59,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:09:59,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:09:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:59,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:09:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:09:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:09:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502068239] [2025-03-04 11:09:59,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:09:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527631553] [2025-03-04 11:09:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527631553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:09:59,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:09:59,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:09:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965436053] [2025-03-04 11:09:59,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:09:59,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:09:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:09:59,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:09:59,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:09:59,422 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 11:09:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:09:59,807 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2025-03-04 11:09:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:09:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 60 [2025-03-04 11:09:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:09:59,810 INFO L225 Difference]: With dead ends: 367 [2025-03-04 11:09:59,810 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 11:09:59,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:09:59,811 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 268 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:09:59,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 212 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:09:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 11:09:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 325. [2025-03-04 11:09:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 265 states have (on average 1.3584905660377358) internal successors, (360), 284 states have internal predecessors, (360), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:09:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 426 transitions. [2025-03-04 11:09:59,832 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 426 transitions. Word has length 60 [2025-03-04 11:09:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:09:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 426 transitions. [2025-03-04 11:09:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 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 11:09:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 426 transitions. [2025-03-04 11:09:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:09:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:09:59,833 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:09:59,839 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 11:10:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:10:00,035 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:00,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -289323777, now seen corresponding path program 1 times [2025-03-04 11:10:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247734905] [2025-03-04 11:10:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:00,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:10:00,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:10:00,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:00,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:00,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247734905] [2025-03-04 11:10:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247734905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696831896] [2025-03-04 11:10:00,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:00,123 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:10:00,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:10:00,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:10:00,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:00,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:00,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:00,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:10:00,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:10:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696831896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:00,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-04 11:10:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739210067] [2025-03-04 11:10:00,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:10:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:00,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:10:00,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:10:00,296 INFO L87 Difference]: Start difference. First operand 325 states and 426 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:00,483 INFO L93 Difference]: Finished difference Result 513 states and 670 transitions. [2025-03-04 11:10:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:10:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 68 [2025-03-04 11:10:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:00,485 INFO L225 Difference]: With dead ends: 513 [2025-03-04 11:10:00,485 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 11:10:00,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:10:00,487 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 97 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:00,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 445 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 11:10:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 349. [2025-03-04 11:10:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 285 states have (on average 1.343859649122807) internal successors, (383), 304 states have internal predecessors, (383), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:10:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 455 transitions. [2025-03-04 11:10:00,506 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 455 transitions. Word has length 68 [2025-03-04 11:10:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:00,506 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 455 transitions. [2025-03-04 11:10:00,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 11:10:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 455 transitions. [2025-03-04 11:10:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:10:00,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:00,507 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:10:00,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:00,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1125520865, now seen corresponding path program 2 times [2025-03-04 11:10:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323065561] [2025-03-04 11:10:00,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:00,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:10:00,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:10:00,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:00,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:00,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176253593] [2025-03-04 11:10:00,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:00,722 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:00,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:10:00,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:10:00,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:10:00,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:00,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:00,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:00,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:00,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323065561] [2025-03-04 11:10:00,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176253593] [2025-03-04 11:10:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176253593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:00,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:10:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903018751] [2025-03-04 11:10:00,848 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:00,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:00,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:00,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:00,848 INFO L87 Difference]: Start difference. First operand 349 states and 455 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:00,939 INFO L93 Difference]: Finished difference Result 498 states and 639 transitions. [2025-03-04 11:10:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2025-03-04 11:10:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:00,942 INFO L225 Difference]: With dead ends: 498 [2025-03-04 11:10:00,942 INFO L226 Difference]: Without dead ends: 494 [2025-03-04 11:10:00,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:00,942 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:00,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 224 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-04 11:10:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 380. [2025-03-04 11:10:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 312 states have (on average 1.3237179487179487) internal successors, (413), 331 states have internal predecessors, (413), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 11:10:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 493 transitions. [2025-03-04 11:10:00,964 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 493 transitions. Word has length 72 [2025-03-04 11:10:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 493 transitions. [2025-03-04 11:10:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 493 transitions. [2025-03-04 11:10:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 11:10:00,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:00,965 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:00,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:01,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 295959034, now seen corresponding path program 1 times [2025-03-04 11:10:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478759624] [2025-03-04 11:10:01,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:01,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 11:10:01,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 11:10:01,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:01,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:01,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478759624] [2025-03-04 11:10:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478759624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:01,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:01,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:10:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000652967] [2025-03-04 11:10:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:01,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:10:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:01,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:10:01,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:01,238 INFO L87 Difference]: Start difference. First operand 380 states and 493 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:01,295 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2025-03-04 11:10:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:10:01,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (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 79 [2025-03-04 11:10:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:01,297 INFO L225 Difference]: With dead ends: 380 [2025-03-04 11:10:01,297 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 11:10:01,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:10:01,297 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:01,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:10:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 11:10:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-04 11:10:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 312 states have (on average 1.310897435897436) internal successors, (409), 330 states have internal predecessors, (409), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 11:10:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 489 transitions. [2025-03-04 11:10:01,319 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 489 transitions. Word has length 79 [2025-03-04 11:10:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 489 transitions. [2025-03-04 11:10:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2025-03-04 11:10:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:10:01,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:01,320 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:01,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:10:01,320 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 584795449, now seen corresponding path program 1 times [2025-03-04 11:10:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085070162] [2025-03-04 11:10:01,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:10:01,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:10:01,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:01,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085070162] [2025-03-04 11:10:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085070162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:10:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793011352] [2025-03-04 11:10:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:10:01,417 INFO L87 Difference]: Start difference. First operand 379 states and 489 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:01,586 INFO L93 Difference]: Finished difference Result 579 states and 774 transitions. [2025-03-04 11:10:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:01,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-04 11:10:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:01,590 INFO L225 Difference]: With dead ends: 579 [2025-03-04 11:10:01,590 INFO L226 Difference]: Without dead ends: 578 [2025-03-04 11:10:01,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:01,591 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:01,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 221 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-04 11:10:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 517. [2025-03-04 11:10:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 436 states have (on average 1.3669724770642202) internal successors, (596), 454 states have internal predecessors, (596), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 11:10:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 704 transitions. [2025-03-04 11:10:01,623 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 704 transitions. Word has length 80 [2025-03-04 11:10:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:01,623 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 704 transitions. [2025-03-04 11:10:01,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:10:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 704 transitions. [2025-03-04 11:10:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:10:01,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:01,624 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:10:01,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 948789720, now seen corresponding path program 1 times [2025-03-04 11:10:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173306208] [2025-03-04 11:10:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:01,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:10:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:10:01,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:01,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173306208] [2025-03-04 11:10:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173306208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258565500] [2025-03-04 11:10:01,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:01,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:01,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:10:01,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:10:01,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:10:01,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:01,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:01,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:01,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258565500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 11:10:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469380959] [2025-03-04 11:10:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:01,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:01,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:01,933 INFO L87 Difference]: Start difference. First operand 517 states and 704 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:02,075 INFO L93 Difference]: Finished difference Result 562 states and 753 transitions. [2025-03-04 11:10:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 81 [2025-03-04 11:10:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:02,077 INFO L225 Difference]: With dead ends: 562 [2025-03-04 11:10:02,077 INFO L226 Difference]: Without dead ends: 561 [2025-03-04 11:10:02,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:02,077 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 86 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:02,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 125 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-04 11:10:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 529. [2025-03-04 11:10:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 448 states have (on average 1.3571428571428572) internal successors, (608), 466 states have internal predecessors, (608), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 11:10:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2025-03-04 11:10:02,122 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 81 [2025-03-04 11:10:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:02,123 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2025-03-04 11:10:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2025-03-04 11:10:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 11:10:02,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:02,123 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:02,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:10:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:10:02,324 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash -652289769, now seen corresponding path program 1 times [2025-03-04 11:10:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469405686] [2025-03-04 11:10:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:02,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:10:02,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:10:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469405686] [2025-03-04 11:10:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469405686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321858448] [2025-03-04 11:10:02,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:02,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:02,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:02,456 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:02,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:10:02,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:10:02,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:10:02,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:02,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:02,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:10:02,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:02,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:10:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321858448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:02,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 11:10:02,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769799472] [2025-03-04 11:10:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:02,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:10:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:02,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:10:02,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:10:02,579 INFO L87 Difference]: Start difference. First operand 529 states and 716 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:02,694 INFO L93 Difference]: Finished difference Result 544 states and 729 transitions. [2025-03-04 11:10:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:10:02,694 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, (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 82 [2025-03-04 11:10:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:02,697 INFO L225 Difference]: With dead ends: 544 [2025-03-04 11:10:02,697 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 11:10:02,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 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 11:10:02,698 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:02,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 11:10:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 533. [2025-03-04 11:10:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 452 states have (on average 1.345132743362832) internal successors, (608), 470 states have internal predecessors, (608), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 11:10:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 716 transitions. [2025-03-04 11:10:02,741 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 716 transitions. Word has length 82 [2025-03-04 11:10:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 716 transitions. [2025-03-04 11:10:02,742 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 716 transitions. [2025-03-04 11:10:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:10:02,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:02,742 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:02,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:02,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:10:02,943 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:02,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1985215914, now seen corresponding path program 1 times [2025-03-04 11:10:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726403354] [2025-03-04 11:10:02,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:10:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:10:02,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:02,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:10:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726403354] [2025-03-04 11:10:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726403354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:03,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198602282] [2025-03-04 11:10:03,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:03,037 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:03,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:10:03,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:10:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:10:03,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:03,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:03,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:10:03,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:10:03,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 11:10:03,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198602282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:03,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2025-03-04 11:10:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623164731] [2025-03-04 11:10:03,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:03,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:10:03,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:03,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:10:03,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:10:03,265 INFO L87 Difference]: Start difference. First operand 533 states and 716 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-04 11:10:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:03,560 INFO L93 Difference]: Finished difference Result 600 states and 786 transitions. [2025-03-04 11:10:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:10:03,560 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 86 [2025-03-04 11:10:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:03,562 INFO L225 Difference]: With dead ends: 600 [2025-03-04 11:10:03,562 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 11:10:03,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=998, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:10:03,563 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 116 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 653 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 11:10:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 561. [2025-03-04 11:10:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 475 states have (on average 1.3305263157894738) internal successors, (632), 493 states have internal predecessors, (632), 57 states have call successors, (57), 10 states have call predecessors, (57), 10 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 11:10:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 746 transitions. [2025-03-04 11:10:03,595 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 746 transitions. Word has length 86 [2025-03-04 11:10:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:03,595 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 746 transitions. [2025-03-04 11:10:03,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-04 11:10:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 746 transitions. [2025-03-04 11:10:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:10:03,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:03,596 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-04 11:10:03,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:03,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:03,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1647431908, now seen corresponding path program 1 times [2025-03-04 11:10:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083222880] [2025-03-04 11:10:03,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:03,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:10:03,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:10:03,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:03,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448625056] [2025-03-04 11:10:03,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:03,820 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:10:03,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:10:03,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:10:03,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:10:03,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:03,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:03,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:03,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:04,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083222880] [2025-03-04 11:10:04,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448625056] [2025-03-04 11:10:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448625056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:04,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661197564] [2025-03-04 11:10:04,461 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:04,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:04,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:04,463 INFO L87 Difference]: Start difference. First operand 561 states and 746 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:04,839 INFO L93 Difference]: Finished difference Result 630 states and 838 transitions. [2025-03-04 11:10:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:10:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-04 11:10:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:04,841 INFO L225 Difference]: With dead ends: 630 [2025-03-04 11:10:04,841 INFO L226 Difference]: Without dead ends: 629 [2025-03-04 11:10:04,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:10:04,842 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:04,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 363 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:10:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-04 11:10:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 601. [2025-03-04 11:10:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 511 states have (on average 1.3268101761252447) internal successors, (678), 529 states have internal predecessors, (678), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 11:10:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 800 transitions. [2025-03-04 11:10:04,879 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 800 transitions. Word has length 87 [2025-03-04 11:10:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:04,879 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 800 transitions. [2025-03-04 11:10:04,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 800 transitions. [2025-03-04 11:10:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:10:04,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:04,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:04,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:10:05,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:10:05,081 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash 469218417, now seen corresponding path program 1 times [2025-03-04 11:10:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751863263] [2025-03-04 11:10:05,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:05,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:10:05,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:10:05,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:05,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474795521] [2025-03-04 11:10:05,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:05,102 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 11:10:05,104 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 11:10:05,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:10:05,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:10:05,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:05,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:05,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:05,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:05,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:05,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751863263] [2025-03-04 11:10:05,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:05,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474795521] [2025-03-04 11:10:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474795521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:05,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:05,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:05,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852391575] [2025-03-04 11:10:05,753 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:05,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:05,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:05,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:05,754 INFO L87 Difference]: Start difference. First operand 601 states and 800 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:06,006 INFO L93 Difference]: Finished difference Result 657 states and 878 transitions. [2025-03-04 11:10:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:10:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2025-03-04 11:10:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:06,008 INFO L225 Difference]: With dead ends: 657 [2025-03-04 11:10:06,009 INFO L226 Difference]: Without dead ends: 656 [2025-03-04 11:10:06,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:10:06,009 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:06,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 263 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-04 11:10:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 641. [2025-03-04 11:10:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 547 states have (on average 1.323583180987203) internal successors, (724), 565 states have internal predecessors, (724), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 11:10:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 854 transitions. [2025-03-04 11:10:06,040 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 854 transitions. Word has length 88 [2025-03-04 11:10:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:06,040 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 854 transitions. [2025-03-04 11:10:06,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:10:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 854 transitions. [2025-03-04 11:10:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:10:06,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:06,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:06,047 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 11:10:06,241 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,SelfDestructingSolverStorable26 [2025-03-04 11:10:06,241 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1660869050, now seen corresponding path program 1 times [2025-03-04 11:10:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754116534] [2025-03-04 11:10:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:06,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 11:10:06,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:10:06,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:06,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:10:06,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:06,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754116534] [2025-03-04 11:10:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754116534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:06,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:06,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:10:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611732498] [2025-03-04 11:10:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:06,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:06,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:06,294 INFO L87 Difference]: Start difference. First operand 641 states and 854 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:06,437 INFO L93 Difference]: Finished difference Result 646 states and 861 transitions. [2025-03-04 11:10:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:10:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-03-04 11:10:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:06,439 INFO L225 Difference]: With dead ends: 646 [2025-03-04 11:10:06,439 INFO L226 Difference]: Without dead ends: 645 [2025-03-04 11:10:06,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:10:06,440 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:06,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 112 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-04 11:10:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 640. [2025-03-04 11:10:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 547 states have (on average 1.3089579524680073) internal successors, (716), 564 states have internal predecessors, (716), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 11:10:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 846 transitions. [2025-03-04 11:10:06,478 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 846 transitions. Word has length 89 [2025-03-04 11:10:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:06,478 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 846 transitions. [2025-03-04 11:10:06,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:10:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 846 transitions. [2025-03-04 11:10:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:10:06,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:06,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:10:06,480 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash -52666993, now seen corresponding path program 1 times [2025-03-04 11:10:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318943305] [2025-03-04 11:10:06,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:06,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:10:06,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:10:06,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:06,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974332889] [2025-03-04 11:10:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:06,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:06,503 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 11:10:06,504 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 11:10:06,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:10:06,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:10:06,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:06,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:10:06,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:07,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:10:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318943305] [2025-03-04 11:10:09,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974332889] [2025-03-04 11:10:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974332889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:09,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:10:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 11:10:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717804263] [2025-03-04 11:10:09,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:10:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:10:09,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:10:09,003 INFO L87 Difference]: Start difference. First operand 640 states and 846 transitions. Second operand has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 11:10:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:13,439 INFO L93 Difference]: Finished difference Result 809 states and 1078 transitions. [2025-03-04 11:10:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:10:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 90 [2025-03-04 11:10:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:13,445 INFO L225 Difference]: With dead ends: 809 [2025-03-04 11:10:13,445 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 11:10:13,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=376, Invalid=814, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:10:13,446 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 350 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:13,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 385 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 11:10:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 11:10:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 595. [2025-03-04 11:10:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 508 states have (on average 1.3208661417322836) internal successors, (671), 525 states have internal predecessors, (671), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 789 transitions. [2025-03-04 11:10:13,491 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 789 transitions. Word has length 90 [2025-03-04 11:10:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:13,491 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 789 transitions. [2025-03-04 11:10:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 11:10:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 789 transitions. [2025-03-04 11:10:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 11:10:13,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:13,493 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:10:13,499 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 11:10:13,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:10:13,697 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:13,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash 319359492, now seen corresponding path program 3 times [2025-03-04 11:10:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:13,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770839368] [2025-03-04 11:10:13,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:13,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-03-04 11:10:13,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:10:13,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:10:13,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108559533] [2025-03-04 11:10:13,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:13,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:13,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:13,717 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 11:10:13,718 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 11:10:13,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 6 equivalence classes. [2025-03-04 11:10:13,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 98 statements. [2025-03-04 11:10:13,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:10:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:13,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:10:13,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-04 11:10:13,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770839368] [2025-03-04 11:10:14,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108559533] [2025-03-04 11:10:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108559533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:14,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 11:10:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573419542] [2025-03-04 11:10:14,071 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:10:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:14,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:10:14,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:14,072 INFO L87 Difference]: Start difference. First operand 595 states and 789 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:10:15,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:10:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:15,736 INFO L93 Difference]: Finished difference Result 637 states and 826 transitions. [2025-03-04 11:10:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:10:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 98 [2025-03-04 11:10:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:15,739 INFO L225 Difference]: With dead ends: 637 [2025-03-04 11:10:15,739 INFO L226 Difference]: Without dead ends: 633 [2025-03-04 11:10:15,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:10:15,739 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 148 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:15,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 361 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 11:10:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-04 11:10:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 592. [2025-03-04 11:10:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 508 states have (on average 1.2834645669291338) internal successors, (652), 522 states have internal predecessors, (652), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 770 transitions. [2025-03-04 11:10:15,785 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 770 transitions. Word has length 98 [2025-03-04 11:10:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 770 transitions. [2025-03-04 11:10:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:10:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 770 transitions. [2025-03-04 11:10:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:10:15,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:15,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:15,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:15,987 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303417, now seen corresponding path program 1 times [2025-03-04 11:10:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463071188] [2025-03-04 11:10:15,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:15,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:10:16,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:10:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:16,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835230428] [2025-03-04 11:10:16,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:16,008 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 11:10:16,009 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 11:10:16,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:10:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:10:16,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:16,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:16,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:16,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463071188] [2025-03-04 11:10:16,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835230428] [2025-03-04 11:10:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835230428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:16,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:16,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:10:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454852240] [2025-03-04 11:10:16,616 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:16,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:10:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:16,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:10:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:10:16,616 INFO L87 Difference]: Start difference. First operand 592 states and 770 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:10:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:16,850 INFO L93 Difference]: Finished difference Result 597 states and 777 transitions. [2025-03-04 11:10:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:10:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 104 [2025-03-04 11:10:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:16,851 INFO L225 Difference]: With dead ends: 597 [2025-03-04 11:10:16,852 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 11:10:16,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:10:16,852 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:16,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 357 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 11:10:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 593. [2025-03-04 11:10:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 509 states have (on average 1.2829076620825148) internal successors, (653), 523 states have internal predecessors, (653), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 771 transitions. [2025-03-04 11:10:16,887 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 771 transitions. Word has length 104 [2025-03-04 11:10:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:16,887 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 771 transitions. [2025-03-04 11:10:16,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:10:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 771 transitions. [2025-03-04 11:10:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 11:10:16,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:16,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:16,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:10:17,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:17,089 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:17,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1944234350, now seen corresponding path program 1 times [2025-03-04 11:10:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:17,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345826367] [2025-03-04 11:10:17,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:17,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 11:10:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:10:17,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:17,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700310663] [2025-03-04 11:10:17,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:17,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:17,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:17,113 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 11:10:17,114 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 11:10:17,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 11:10:17,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:10:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:17,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:10:17,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 11:10:17,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345826367] [2025-03-04 11:10:18,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700310663] [2025-03-04 11:10:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700310663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:18,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 11:10:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020062884] [2025-03-04 11:10:18,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:10:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:18,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:10:18,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:10:18,417 INFO L87 Difference]: Start difference. First operand 593 states and 771 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:10:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:18,903 INFO L93 Difference]: Finished difference Result 603 states and 782 transitions. [2025-03-04 11:10:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:10:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 105 [2025-03-04 11:10:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:18,906 INFO L225 Difference]: With dead ends: 603 [2025-03-04 11:10:18,907 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 11:10:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:10:18,908 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 34 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 421 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:10:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 11:10:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 594. [2025-03-04 11:10:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 510 states have (on average 1.2823529411764707) internal successors, (654), 524 states have internal predecessors, (654), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 11:10:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 772 transitions. [2025-03-04 11:10:18,953 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 772 transitions. Word has length 105 [2025-03-04 11:10:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:18,954 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 772 transitions. [2025-03-04 11:10:18,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 11:10:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 772 transitions. [2025-03-04 11:10:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 11:10:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:18,955 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:10:18,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:19,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 11:10:19,156 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:19,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1900902547, now seen corresponding path program 1 times [2025-03-04 11:10:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81871740] [2025-03-04 11:10:19,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:10:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:10:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81871740] [2025-03-04 11:10:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81871740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012517606] [2025-03-04 11:10:19,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:19,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:19,220 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 11:10:19,221 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 11:10:19,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 11:10:19,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 11:10:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:19,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:10:19,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:19,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:10:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012517606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:19,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:19,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 11:10:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639533905] [2025-03-04 11:10:19,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:10:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:19,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:10:19,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:19,417 INFO L87 Difference]: Start difference. First operand 594 states and 772 transitions. Second operand has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:10:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:19,688 INFO L93 Difference]: Finished difference Result 1212 states and 1561 transitions. [2025-03-04 11:10:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:10:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 108 [2025-03-04 11:10:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:19,691 INFO L225 Difference]: With dead ends: 1212 [2025-03-04 11:10:19,692 INFO L226 Difference]: Without dead ends: 1210 [2025-03-04 11:10:19,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:19,692 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 320 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:19,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 502 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:10:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-04 11:10:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 661. [2025-03-04 11:10:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 567 states have (on average 1.271604938271605) internal successors, (721), 581 states have internal predecessors, (721), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 11:10:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 859 transitions. [2025-03-04 11:10:19,736 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 859 transitions. Word has length 108 [2025-03-04 11:10:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:19,736 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 859 transitions. [2025-03-04 11:10:19,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 11 states have internal predecessors, (108), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 11:10:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 859 transitions. [2025-03-04 11:10:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:10:19,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:19,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:19,743 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 11:10:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 11:10:19,937 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -141722729, now seen corresponding path program 1 times [2025-03-04 11:10:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426636410] [2025-03-04 11:10:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:19,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:10:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:10:19,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:19,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426636410] [2025-03-04 11:10:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426636410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:10:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:10:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:10:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522386708] [2025-03-04 11:10:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:10:20,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:10:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:20,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:10:20,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:10:20,007 INFO L87 Difference]: Start difference. First operand 661 states and 859 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 11:10:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:20,114 INFO L93 Difference]: Finished difference Result 661 states and 859 transitions. [2025-03-04 11:10:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2025-03-04 11:10:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:20,116 INFO L225 Difference]: With dead ends: 661 [2025-03-04 11:10:20,116 INFO L226 Difference]: Without dead ends: 660 [2025-03-04 11:10:20,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:10:20,117 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:20,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 140 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-04 11:10:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 657. [2025-03-04 11:10:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 564 states have (on average 1.2712765957446808) internal successors, (717), 577 states have internal predecessors, (717), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 11:10:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 855 transitions. [2025-03-04 11:10:20,157 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 855 transitions. Word has length 106 [2025-03-04 11:10:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:20,158 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 855 transitions. [2025-03-04 11:10:20,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 11:10:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 855 transitions. [2025-03-04 11:10:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:10:20,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:20,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:20,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 11:10:20,160 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash -98437328, now seen corresponding path program 1 times [2025-03-04 11:10:20,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:20,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822482779] [2025-03-04 11:10:20,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:20,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:10:20,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:10:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899999415] [2025-03-04 11:10:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:20,177 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 11:10:20,179 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 11:10:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:10:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:10:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:20,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:10:20,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:20,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822482779] [2025-03-04 11:10:20,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899999415] [2025-03-04 11:10:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899999415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:20,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:10:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359985587] [2025-03-04 11:10:20,562 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:20,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:20,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:20,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:20,562 INFO L87 Difference]: Start difference. First operand 657 states and 855 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 11:10:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:20,749 INFO L93 Difference]: Finished difference Result 751 states and 996 transitions. [2025-03-04 11:10:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 107 [2025-03-04 11:10:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:20,752 INFO L225 Difference]: With dead ends: 751 [2025-03-04 11:10:20,752 INFO L226 Difference]: Without dead ends: 742 [2025-03-04 11:10:20,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:20,753 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:20,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 205 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-04 11:10:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 685. [2025-03-04 11:10:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 588 states have (on average 1.2942176870748299) internal successors, (761), 601 states have internal predecessors, (761), 73 states have call successors, (73), 10 states have call predecessors, (73), 10 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 11:10:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 907 transitions. [2025-03-04 11:10:20,794 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 907 transitions. Word has length 107 [2025-03-04 11:10:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 907 transitions. [2025-03-04 11:10:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 11:10:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 907 transitions. [2025-03-04 11:10:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 11:10:20,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:20,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:20,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 11:10:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:20,996 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1986707460, now seen corresponding path program 1 times [2025-03-04 11:10:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594008948] [2025-03-04 11:10:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:10:21,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:10:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 11:10:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594008948] [2025-03-04 11:10:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594008948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301461496] [2025-03-04 11:10:21,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:21,159 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 11:10:21,161 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 11:10:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 11:10:21,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 11:10:21,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:21,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:21,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:21,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:21,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:10:21,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301461496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:21,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:21,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2025-03-04 11:10:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602398357] [2025-03-04 11:10:21,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:21,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:10:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:21,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:10:21,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:10:21,370 INFO L87 Difference]: Start difference. First operand 685 states and 907 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 11:10:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:21,780 INFO L93 Difference]: Finished difference Result 1168 states and 1575 transitions. [2025-03-04 11:10:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:10:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 110 [2025-03-04 11:10:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:21,783 INFO L225 Difference]: With dead ends: 1168 [2025-03-04 11:10:21,783 INFO L226 Difference]: Without dead ends: 1002 [2025-03-04 11:10:21,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:10:21,785 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 246 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:21,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 507 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:10:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-04 11:10:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 673. [2025-03-04 11:10:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 577 states have (on average 1.3258232235701906) internal successors, (765), 590 states have internal predecessors, (765), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 11:10:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 911 transitions. [2025-03-04 11:10:21,828 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 911 transitions. Word has length 110 [2025-03-04 11:10:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:21,828 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 911 transitions. [2025-03-04 11:10:21,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 11:10:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 911 transitions. [2025-03-04 11:10:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 11:10:21,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:21,829 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2025-03-04 11:10:21,836 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 11:10:22,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:22,030 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -685201257, now seen corresponding path program 2 times [2025-03-04 11:10:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446894240] [2025-03-04 11:10:22,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:22,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 11:10:22,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:10:22,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992111348] [2025-03-04 11:10:22,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:22,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:22,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:22,047 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 11:10:22,049 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 11:10:22,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 11:10:22,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:10:22,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:22,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:22,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:10:22,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:10:22,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446894240] [2025-03-04 11:10:22,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992111348] [2025-03-04 11:10:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992111348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:22,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:10:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289078090] [2025-03-04 11:10:22,690 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:10:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:22,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:10:22,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:10:22,693 INFO L87 Difference]: Start difference. First operand 673 states and 911 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 11:10:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:22,913 INFO L93 Difference]: Finished difference Result 1121 states and 1552 transitions. [2025-03-04 11:10:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:10:22,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 113 [2025-03-04 11:10:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:22,916 INFO L225 Difference]: With dead ends: 1121 [2025-03-04 11:10:22,916 INFO L226 Difference]: Without dead ends: 1115 [2025-03-04 11:10:22,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:10:22,916 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:22,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 221 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-04 11:10:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 776. [2025-03-04 11:10:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 670 states have (on average 1.2582089552238807) internal successors, (843), 681 states have internal predecessors, (843), 85 states have call successors, (85), 9 states have call predecessors, (85), 9 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:10:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1013 transitions. [2025-03-04 11:10:22,969 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1013 transitions. Word has length 113 [2025-03-04 11:10:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:22,969 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1013 transitions. [2025-03-04 11:10:22,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 11:10:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1013 transitions. [2025-03-04 11:10:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:10:22,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:22,970 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:22,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 11:10:23,170 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,SelfDestructingSolverStorable36 [2025-03-04 11:10:23,170 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:23,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 233597526, now seen corresponding path program 2 times [2025-03-04 11:10:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996119190] [2025-03-04 11:10:23,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:23,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:10:23,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:10:23,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:23,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:23,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293516926] [2025-03-04 11:10:23,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:10:23,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:23,190 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 11:10:23,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 11:10:23,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:10:23,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:10:23,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:10:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:10:23,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 11:10:23,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996119190] [2025-03-04 11:10:23,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:10:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293516926] [2025-03-04 11:10:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293516926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:23,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:10:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 11:10:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230844739] [2025-03-04 11:10:23,649 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:10:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:10:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:23,649 INFO L87 Difference]: Start difference. First operand 776 states and 1013 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 11:10:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:23,823 INFO L93 Difference]: Finished difference Result 1011 states and 1316 transitions. [2025-03-04 11:10:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:10:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 114 [2025-03-04 11:10:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:23,826 INFO L225 Difference]: With dead ends: 1011 [2025-03-04 11:10:23,826 INFO L226 Difference]: Without dead ends: 856 [2025-03-04 11:10:23,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:10:23,826 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 92 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 316 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-04 11:10:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 839. [2025-03-04 11:10:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 725 states have (on average 1.2510344827586206) internal successors, (907), 736 states have internal predecessors, (907), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-04 11:10:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1093 transitions. [2025-03-04 11:10:23,882 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1093 transitions. Word has length 114 [2025-03-04 11:10:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:23,882 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1093 transitions. [2025-03-04 11:10:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 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 11:10:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1093 transitions. [2025-03-04 11:10:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 11:10:23,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:23,883 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:23,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 11:10:24,083 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,SelfDestructingSolverStorable37 [2025-03-04 11:10:24,083 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 563493327, now seen corresponding path program 1 times [2025-03-04 11:10:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067270384] [2025-03-04 11:10:24,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:24,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 11:10:24,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 11:10:24,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:24,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:10:24,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:24,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067270384] [2025-03-04 11:10:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067270384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:24,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787815937] [2025-03-04 11:10:24,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:24,242 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 11:10:24,245 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 11:10:24,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 11:10:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 11:10:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:24,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:10:24,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 387 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 11:10:24,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 11:10:24,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787815937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:24,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:24,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2025-03-04 11:10:24,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539338320] [2025-03-04 11:10:24,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:24,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:10:24,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:24,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:10:24,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:10:24,616 INFO L87 Difference]: Start difference. First operand 839 states and 1093 transitions. Second operand has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 11:10:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:25,076 INFO L93 Difference]: Finished difference Result 1063 states and 1356 transitions. [2025-03-04 11:10:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 11:10:25,076 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 133 [2025-03-04 11:10:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:25,079 INFO L225 Difference]: With dead ends: 1063 [2025-03-04 11:10:25,079 INFO L226 Difference]: Without dead ends: 1051 [2025-03-04 11:10:25,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=667, Invalid=2195, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 11:10:25,080 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 282 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:25,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 709 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:10:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-04 11:10:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1019. [2025-03-04 11:10:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 888 states have (on average 1.222972972972973) internal successors, (1086), 899 states have internal predecessors, (1086), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:10:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1296 transitions. [2025-03-04 11:10:25,168 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1296 transitions. Word has length 133 [2025-03-04 11:10:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1296 transitions. [2025-03-04 11:10:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.76) internal successors, (144), 26 states have internal predecessors, (144), 10 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-03-04 11:10:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1296 transitions. [2025-03-04 11:10:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 11:10:25,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:25,169 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:25,175 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 11:10:25,372 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,SelfDestructingSolverStorable38 [2025-03-04 11:10:25,372 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1112892423, now seen corresponding path program 1 times [2025-03-04 11:10:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770188853] [2025-03-04 11:10:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 11:10:25,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 11:10:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:10:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:10:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770188853] [2025-03-04 11:10:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770188853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:10:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282942564] [2025-03-04 11:10:25,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:10:25,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:25,565 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 11:10:25,567 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 11:10:25,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 11:10:25,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 11:10:25,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:10:25,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:10:25,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:10:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:10:25,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:10:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:10:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282942564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:10:26,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:10:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-03-04 11:10:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896427059] [2025-03-04 11:10:26,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:10:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:10:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:10:26,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:10:26,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:10:26,969 INFO L87 Difference]: Start difference. First operand 1019 states and 1296 transitions. Second operand has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-03-04 11:10:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:10:27,924 INFO L93 Difference]: Finished difference Result 1508 states and 1932 transitions. [2025-03-04 11:10:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:10:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 138 [2025-03-04 11:10:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:10:27,928 INFO L225 Difference]: With dead ends: 1508 [2025-03-04 11:10:27,928 INFO L226 Difference]: Without dead ends: 1506 [2025-03-04 11:10:27,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:10:27,929 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 552 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:10:27,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 928 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:10:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-04 11:10:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1311. [2025-03-04 11:10:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1156 states have (on average 1.2249134948096885) internal successors, (1416), 1167 states have internal predecessors, (1416), 129 states have call successors, (129), 14 states have call predecessors, (129), 14 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 11:10:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1674 transitions. [2025-03-04 11:10:28,024 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1674 transitions. Word has length 138 [2025-03-04 11:10:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:10:28,024 INFO L471 AbstractCegarLoop]: Abstraction has 1311 states and 1674 transitions. [2025-03-04 11:10:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.285714285714286) internal successors, (216), 22 states have internal predecessors, (216), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-03-04 11:10:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1674 transitions. [2025-03-04 11:10:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 11:10:28,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:10:28,025 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:10:28,033 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 11:10:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 11:10:28,225 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:10:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:10:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1295834107, now seen corresponding path program 3 times [2025-03-04 11:10:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:10:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424555787] [2025-03-04 11:10:28,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:10:28,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 6 equivalence classes. [2025-03-04 11:10:28,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:10:28,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:10:28,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:10:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38784308] [2025-03-04 11:10:28,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:10:28,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:10:28,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:10:28,253 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 11:10:28,254 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 11:10:28,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 6 equivalence classes. [2025-03-04 11:10:28,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 140 statements. [2025-03-04 11:10:28,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:10:28,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:10:28,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 11:10:28,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:11:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-04 11:11:00,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:11:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:11:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424555787] [2025-03-04 11:11:02,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:11:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38784308] [2025-03-04 11:11:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38784308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:11:02,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:11:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:11:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194423393] [2025-03-04 11:11:02,469 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:11:02,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:11:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:11:02,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:11:02,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:11:02,470 INFO L87 Difference]: Start difference. First operand 1311 states and 1674 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:11:06,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:11:10,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:11:14,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:11:18,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:11:22,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []