./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/sqrt1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/sqrt1-ll.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 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:06:24,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:06:24,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:06:24,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:06:24,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:06:24,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:06:24,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:06:24,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:06:24,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:06:24,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:06:24,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:06:24,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:06:24,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:06:24,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:06:24,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:06:24,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:06:24,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:06:24,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:06:24,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:06:24,464 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 -> 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae [2025-03-17 15:06:24,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:06:24,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:06:24,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:06:24,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:06:24,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:06:24,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2025-03-17 15:06:25,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2fb7431/3d87702efa9b49aea2ea472a37844321/FLAG58f0cf18d [2025-03-17 15:06:25,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:06:25,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2025-03-17 15:06:25,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2fb7431/3d87702efa9b49aea2ea472a37844321/FLAG58f0cf18d [2025-03-17 15:06:26,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2fb7431/3d87702efa9b49aea2ea472a37844321 [2025-03-17 15:06:26,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:06:26,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:06:26,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:06:26,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:06:26,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:06:26,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cae1d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26, skipping insertion in model container [2025-03-17 15:06:26,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:06:26,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:06:26,484 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:06:26,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:06:26,511 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:06:26,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26 WrapperNode [2025-03-17 15:06:26,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:06:26,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:06:26,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:06:26,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:06:26,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,539 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2025-03-17 15:06:26,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:06:26,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:06:26,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:06:26,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:06:26,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,565 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-17 15:06:26,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:06:26,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:06:26,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:06:26,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:06:26,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (1/1) ... [2025-03-17 15:06:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:06:26,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:26,600 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-17 15:06:26,602 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-17 15:06:26,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:06:26,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:06:26,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:06:26,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:06:26,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:06:26,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:06:26,658 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:06:26,660 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:06:26,907 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-17 15:06:26,908 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:06:26,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:06:26,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:06:26,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:06:26 BoogieIcfgContainer [2025-03-17 15:06:26,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:06:26,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:06:26,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:06:26,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:06:26,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:06:26" (1/3) ... [2025-03-17 15:06:26,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c888fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:06:26, skipping insertion in model container [2025-03-17 15:06:26,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:06:26" (2/3) ... [2025-03-17 15:06:26,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c888fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:06:26, skipping insertion in model container [2025-03-17 15:06:26,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:06:26" (3/3) ... [2025-03-17 15:06:26,930 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll.c [2025-03-17 15:06:26,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:06:26,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll.c that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 50 error locations. [2025-03-17 15:06:26,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:06:27,003 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;@72b58a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:06:27,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-17 15:06:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 107 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:06:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 15:06:27,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:27,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 15:06:27,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:27,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 4479, now seen corresponding path program 1 times [2025-03-17 15:06:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:27,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301377227] [2025-03-17 15:06:27,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:27,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 15:06:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 15:06:27,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:27,124 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-17 15:06:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:27,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301377227] [2025-03-17 15:06:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301377227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:27,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:06:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328683710] [2025-03-17 15:06:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:27,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:27,146 INFO L87 Difference]: Start difference. First operand has 115 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 107 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 15:06:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:27,236 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2025-03-17 15:06:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 15:06:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:27,241 INFO L225 Difference]: With dead ends: 216 [2025-03-17 15:06:27,241 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 15:06:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:06:27,245 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:27,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 15:06:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 15:06:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 91 states have internal predecessors, (92), 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-17 15:06:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-03-17 15:06:27,276 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 2 [2025-03-17 15:06:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:27,277 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-03-17 15:06:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 15:06:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-03-17 15:06:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 15:06:27,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:27,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 15:06:27,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:06:27,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:27,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 138924, now seen corresponding path program 1 times [2025-03-17 15:06:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627709293] [2025-03-17 15:06:27,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 15:06:27,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 15:06:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:27,309 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-17 15:06:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627709293] [2025-03-17 15:06:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627709293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:06:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934587818] [2025-03-17 15:06:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:27,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:27,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:27,314 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 15:06:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:27,401 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2025-03-17 15:06:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:27,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 15:06:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:27,406 INFO L225 Difference]: With dead ends: 181 [2025-03-17 15:06:27,406 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 15:06:27,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:06:27,406 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 67 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:27,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 15:06:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2025-03-17 15:06:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 124 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:06:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2025-03-17 15:06:27,430 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 3 [2025-03-17 15:06:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:27,430 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2025-03-17 15:06:27,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 15:06:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2025-03-17 15:06:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:06:27,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:27,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:27,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:06:27,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:27,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2007371781, now seen corresponding path program 1 times [2025-03-17 15:06:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778049651] [2025-03-17 15:06:27,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:06:27,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:06:27,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:27,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097269111] [2025-03-17 15:06:27,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:27,479 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-17 15:06:27,480 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-17 15:06:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:06:27,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:06:27,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:27,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:06:27,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:27,567 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-17 15:06:27,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:06:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778049651] [2025-03-17 15:06:27,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097269111] [2025-03-17 15:06:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097269111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:27,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:06:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509825843] [2025-03-17 15:06:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:27,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:27,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:27,570 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:06:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:27,661 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2025-03-17 15:06:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 15:06:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:27,662 INFO L225 Difference]: With dead ends: 174 [2025-03-17 15:06:27,662 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 15:06:27,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 15:06:27,663 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 59 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:27,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 15:06:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2025-03-17 15:06:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 126 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:06:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2025-03-17 15:06:27,673 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 16 [2025-03-17 15:06:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:27,673 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2025-03-17 15:06:27,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:06:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2025-03-17 15:06:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:06:27,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:27,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:27,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:06:27,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:27,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash 617395082, now seen corresponding path program 1 times [2025-03-17 15:06:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969602721] [2025-03-17 15:06:27,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:27,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:06:27,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:06:27,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284767714] [2025-03-17 15:06:27,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:27,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:27,899 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-17 15:06:27,901 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-17 15:06:27,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:06:27,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:06:27,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:27,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:27,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:06:27,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:27,962 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-17 15:06:27,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:06:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969602721] [2025-03-17 15:06:27,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284767714] [2025-03-17 15:06:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284767714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:27,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:06:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120307154] [2025-03-17 15:06:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:27,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:27,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:27,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:27,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:27,964 INFO L87 Difference]: Start difference. First operand 137 states and 157 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, (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-17 15:06:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:28,049 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2025-03-17 15:06:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:28,050 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, (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 23 [2025-03-17 15:06:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:28,051 INFO L225 Difference]: With dead ends: 164 [2025-03-17 15:06:28,051 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 15:06:28,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-17 15:06:28,052 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 125 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 15:06:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2025-03-17 15:06:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.5) internal successors, (150), 136 states have internal predecessors, (150), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:06:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2025-03-17 15:06:28,059 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 23 [2025-03-17 15:06:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:28,060 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2025-03-17 15:06:28,060 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, (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-17 15:06:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2025-03-17 15:06:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:06:28,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:28,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:28,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:06:28,261 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,SelfDestructingSolverStorable3 [2025-03-17 15:06:28,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1959378409, now seen corresponding path program 1 times [2025-03-17 15:06:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-03-17 15:06:28,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:28,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:06:28,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:06:28,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:28,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:28,316 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-17 15:06:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-03-17 15:06:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558569624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:28,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:06:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575381623] [2025-03-17 15:06:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:28,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:28,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:28,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:28,319 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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-17 15:06:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:28,394 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2025-03-17 15:06:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 24 [2025-03-17 15:06:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:28,395 INFO L225 Difference]: With dead ends: 156 [2025-03-17 15:06:28,395 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 15:06:28,396 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-17 15:06:28,396 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:28,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 15:06:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-03-17 15:06:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.48) internal successors, (148), 136 states have internal predecessors, (148), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:06:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2025-03-17 15:06:28,405 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 24 [2025-03-17 15:06:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2025-03-17 15:06:28,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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-17 15:06:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2025-03-17 15:06:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:06:28,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:28,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:28,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:06:28,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 611188584, now seen corresponding path program 1 times [2025-03-17 15:06:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246071658] [2025-03-17 15:06:28,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:06:28,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:06:28,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:28,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:28,463 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-17 15:06:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246071658] [2025-03-17 15:06:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246071658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:06:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463789583] [2025-03-17 15:06:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:28,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:06:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:28,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:06:28,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:06:28,465 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 15:06:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:28,538 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2025-03-17 15:06:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2025-03-17 15:06:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:28,540 INFO L225 Difference]: With dead ends: 162 [2025-03-17 15:06:28,540 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 15:06:28,540 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-17 15:06:28,540 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:28,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 15:06:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-17 15:06:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 139 states have internal predecessors, (146), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:06:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2025-03-17 15:06:28,548 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 25 [2025-03-17 15:06:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:28,548 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2025-03-17 15:06:28,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 15:06:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2025-03-17 15:06:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 15:06:28,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:28,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:06:28,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:28,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1058288826, now seen corresponding path program 1 times [2025-03-17 15:06:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235088508] [2025-03-17 15:06:28,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:06:28,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:06:28,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:28,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:28,625 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-17 15:06:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235088508] [2025-03-17 15:06:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235088508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:28,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:06:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926518829] [2025-03-17 15:06:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:28,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:06:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:28,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:06:28,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:28,626 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-17 15:06:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:28,758 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2025-03-17 15:06:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:06:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 27 [2025-03-17 15:06:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:28,759 INFO L225 Difference]: With dead ends: 156 [2025-03-17 15:06:28,759 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 15:06:28,760 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-17 15:06:28,760 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 83 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:28,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 177 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 15:06:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-17 15:06:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 139 states have internal predecessors, (144), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:06:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2025-03-17 15:06:28,773 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 27 [2025-03-17 15:06:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:28,773 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2025-03-17 15:06:28,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-17 15:06:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2025-03-17 15:06:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:06:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:28,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:06:28,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2080578814, now seen corresponding path program 1 times [2025-03-17 15:06:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340628497] [2025-03-17 15:06:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:28,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:06:28,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:06:28,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:28,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:28,855 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-17 15:06:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340628497] [2025-03-17 15:06:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340628497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:06:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668392216] [2025-03-17 15:06:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:06:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:28,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:06:28,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:28,857 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 15:06:32,959 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-17 15:06:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:33,004 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2025-03-17 15:06:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:06:33,005 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), 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 31 [2025-03-17 15:06:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:33,006 INFO L225 Difference]: With dead ends: 156 [2025-03-17 15:06:33,006 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 15:06:33,006 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-17 15:06:33,006 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 77 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:33,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 167 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 15:06:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 15:06:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-17 15:06:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.451219512195122) internal successors, (119), 118 states have internal predecessors, (119), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:06:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2025-03-17 15:06:33,016 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 31 [2025-03-17 15:06:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2025-03-17 15:06:33,016 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), 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-17 15:06:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2025-03-17 15:06:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:06:33,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:33,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:33,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:06:33,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2060089732, now seen corresponding path program 1 times [2025-03-17 15:06:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410883528] [2025-03-17 15:06:33,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:06:33,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:06:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:33,088 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-17 15:06:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:33,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410883528] [2025-03-17 15:06:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410883528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:33,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:33,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:06:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298741416] [2025-03-17 15:06:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:33,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:06:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:33,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:06:33,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:33,089 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:06:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:33,175 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2025-03-17 15:06:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:06:33,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-17 15:06:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:33,176 INFO L225 Difference]: With dead ends: 131 [2025-03-17 15:06:33,176 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 15:06:33,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:33,177 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:33,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 15:06:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-17 15:06:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 119 states have internal predecessors, (120), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:06:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2025-03-17 15:06:33,182 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 44 [2025-03-17 15:06:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:33,183 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2025-03-17 15:06:33,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:06:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2025-03-17 15:06:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:06:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:33,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:33,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:06:33,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 561727766, now seen corresponding path program 1 times [2025-03-17 15:06:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995062891] [2025-03-17 15:06:33,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:33,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:06:33,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:06:33,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:33,257 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-17 15:06:33,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:33,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995062891] [2025-03-17 15:06:33,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995062891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:33,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:06:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:06:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018134947] [2025-03-17 15:06:33,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:33,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:06:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:33,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:06:33,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:33,258 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:06:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:33,329 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2025-03-17 15:06:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:06:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-17 15:06:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:33,330 INFO L225 Difference]: With dead ends: 131 [2025-03-17 15:06:33,330 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 15:06:33,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:06:33,331 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:33,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 15:06:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 15:06:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 120 states have internal predecessors, (121), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:06:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2025-03-17 15:06:33,337 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 45 [2025-03-17 15:06:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:33,337 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2025-03-17 15:06:33,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:06:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2025-03-17 15:06:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 15:06:33,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:33,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:06:33,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:33,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1345493708, now seen corresponding path program 1 times [2025-03-17 15:06:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670930672] [2025-03-17 15:06:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:33,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 15:06:33,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:06:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:06:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670930672] [2025-03-17 15:06:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670930672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334495476] [2025-03-17 15:06:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:33,403 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-17 15:06:33,404 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-17 15:06:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 15:06:33,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:06:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:33,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:06:33,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:06:33,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:06:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334495476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:33,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 15:06:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773759444] [2025-03-17 15:06:33,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:33,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:06:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:33,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:06:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:06:33,580 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:06:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:33,699 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2025-03-17 15:06:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:06:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-03-17 15:06:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:33,700 INFO L225 Difference]: With dead ends: 223 [2025-03-17 15:06:33,700 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 15:06:33,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 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-17 15:06:33,701 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 224 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:33,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 203 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 15:06:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 121. [2025-03-17 15:06:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 111 states have internal predecessors, (112), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:06:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-03-17 15:06:33,710 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 47 [2025-03-17 15:06:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:33,710 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-03-17 15:06:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:06:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-03-17 15:06:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:06:33,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:33,711 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-17 15:06:33,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:06:33,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:33,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:33,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1117550989, now seen corresponding path program 1 times [2025-03-17 15:06:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518002578] [2025-03-17 15:06:33,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:33,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:06:33,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:06:33,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545883211] [2025-03-17 15:06:33,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:33,934 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-17 15:06:33,940 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-17 15:06:33,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:06:33,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:06:33,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:33,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:33,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:06:33,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:06:34,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:06:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518002578] [2025-03-17 15:06:34,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545883211] [2025-03-17 15:06:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545883211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:34,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:06:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 15:06:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738344025] [2025-03-17 15:06:34,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:06:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:34,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:06:34,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:06:34,207 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:06:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:34,372 INFO L93 Difference]: Finished difference Result 297 states and 319 transitions. [2025-03-17 15:06:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:06:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2025-03-17 15:06:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:34,374 INFO L225 Difference]: With dead ends: 297 [2025-03-17 15:06:34,375 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 15:06:34,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:06:34,376 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 340 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:34,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 285 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 15:06:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2025-03-17 15:06:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.388157894736842) internal successors, (211), 178 states have internal predecessors, (211), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:06:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 241 transitions. [2025-03-17 15:06:34,400 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 241 transitions. Word has length 60 [2025-03-17 15:06:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:34,400 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 241 transitions. [2025-03-17 15:06:34,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 15:06:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 241 transitions. [2025-03-17 15:06:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:06:34,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:34,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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-17 15:06:34,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:06:34,601 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-17 15:06:34,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:34,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2055510510, now seen corresponding path program 1 times [2025-03-17 15:06:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516227631] [2025-03-17 15:06:34,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:34,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:06:34,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:06:34,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:34,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983250593] [2025-03-17 15:06:34,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:34,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:34,625 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-17 15:06:34,629 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-17 15:06:34,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:06:34,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:06:34,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:34,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:06:34,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:34,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516227631] [2025-03-17 15:06:34,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983250593] [2025-03-17 15:06:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983250593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:34,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:06:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-17 15:06:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825221881] [2025-03-17 15:06:34,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:34,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:06:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:34,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:06:34,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:06:34,863 INFO L87 Difference]: Start difference. First operand 195 states and 241 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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-17 15:06:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:35,063 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2025-03-17 15:06:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:06:35,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 67 [2025-03-17 15:06:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:35,064 INFO L225 Difference]: With dead ends: 255 [2025-03-17 15:06:35,064 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 15:06:35,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:06:35,065 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 177 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:35,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 201 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:06:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 15:06:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 191. [2025-03-17 15:06:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 173 states have internal predecessors, (196), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 15:06:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2025-03-17 15:06:35,079 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 67 [2025-03-17 15:06:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:35,079 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2025-03-17 15:06:35,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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-17 15:06:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2025-03-17 15:06:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:06:35,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:35,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:35,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:06:35,280 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-17 15:06:35,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 703683681, now seen corresponding path program 1 times [2025-03-17 15:06:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134167178] [2025-03-17 15:06:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:35,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:06:35,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:06:35,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:35,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:35,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134167178] [2025-03-17 15:06:35,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134167178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:35,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779811104] [2025-03-17 15:06:35,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:35,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:35,360 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-17 15:06:35,362 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-17 15:06:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:06:35,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:06:35,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:35,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:35,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:06:35,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:35,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779811104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:35,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 15:06:35,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429515059] [2025-03-17 15:06:35,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:06:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:35,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:06:35,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:06:35,639 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 10 states, 9 states have (on average 13.222222222222221) internal successors, (119), 10 states have internal predecessors, (119), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:06:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:35,771 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2025-03-17 15:06:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:06:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.222222222222221) internal successors, (119), 10 states have internal predecessors, (119), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 68 [2025-03-17 15:06:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:35,772 INFO L225 Difference]: With dead ends: 191 [2025-03-17 15:06:35,772 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 15:06:35,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:06:35,773 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 208 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:35,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 15:06:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-17 15:06:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 154 states have (on average 1.2272727272727273) internal successors, (189), 170 states have internal predecessors, (189), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 15:06:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 221 transitions. [2025-03-17 15:06:35,781 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 221 transitions. Word has length 68 [2025-03-17 15:06:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:35,782 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 221 transitions. [2025-03-17 15:06:35,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.222222222222221) internal successors, (119), 10 states have internal predecessors, (119), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:06:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 221 transitions. [2025-03-17 15:06:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:06:35,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:35,783 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:06:35,788 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-17 15:06:35,983 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-17 15:06:35,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash 339357680, now seen corresponding path program 1 times [2025-03-17 15:06:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807046473] [2025-03-17 15:06:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:35,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:06:35,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:06:35,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:35,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807046473] [2025-03-17 15:06:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807046473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320605724] [2025-03-17 15:06:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:36,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:36,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:36,055 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-17 15:06:36,057 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-17 15:06:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:06:36,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:06:36,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:36,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:36,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:06:36,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:36,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320605724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:36,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 15:06:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122676855] [2025-03-17 15:06:36,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:36,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:06:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:36,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:06:36,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:06:36,326 INFO L87 Difference]: Start difference. First operand 188 states and 221 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:06:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:36,556 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2025-03-17 15:06:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:06:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 69 [2025-03-17 15:06:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:36,558 INFO L225 Difference]: With dead ends: 214 [2025-03-17 15:06:36,558 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 15:06:36,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:06:36,558 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 133 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:36,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 219 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:06:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 15:06:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 181. [2025-03-17 15:06:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.1233766233766234) internal successors, (173), 163 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 15:06:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2025-03-17 15:06:36,567 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 69 [2025-03-17 15:06:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2025-03-17 15:06:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 10 states have internal predecessors, (121), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-17 15:06:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2025-03-17 15:06:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 15:06:36,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:36,568 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-17 15:06:36,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:06:36,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:36,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -294782514, now seen corresponding path program 1 times [2025-03-17 15:06:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197390447] [2025-03-17 15:06:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:06:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:06:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197390447] [2025-03-17 15:06:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197390447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866131571] [2025-03-17 15:06:36,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:36,842 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-17 15:06:36,843 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-17 15:06:36,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:06:36,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:06:36,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:36,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:36,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:06:36,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:06:37,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:06:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866131571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:06:37,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:06:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-17 15:06:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345868011] [2025-03-17 15:06:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:06:37,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:06:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:06:37,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:06:37,044 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-17 15:06:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:37,140 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2025-03-17 15:06:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:06:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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 71 [2025-03-17 15:06:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:37,141 INFO L225 Difference]: With dead ends: 181 [2025-03-17 15:06:37,141 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 15:06:37,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:06:37,142 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 67 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:37,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 112 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 15:06:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 15:06:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 135 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:06:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2025-03-17 15:06:37,152 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 71 [2025-03-17 15:06:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2025-03-17 15:06:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-17 15:06:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2025-03-17 15:06:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 15:06:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:37,153 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 15:06:37,161 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-17 15:06:37,354 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,SelfDestructingSolverStorable15 [2025-03-17 15:06:37,354 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:37,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1452660262, now seen corresponding path program 1 times [2025-03-17 15:06:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26526003] [2025-03-17 15:06:37,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:37,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 15:06:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 15:06:37,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:06:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26526003] [2025-03-17 15:06:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26526003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987124149] [2025-03-17 15:06:37,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:06:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:37,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:37,519 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-17 15:06:37,520 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-17 15:06:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 15:06:37,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 15:06:37,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:06:37,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:37,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:06:37,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:06:37,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 15:06:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987124149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:38,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-17 15:06:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120439066] [2025-03-17 15:06:38,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:38,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:06:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:38,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:06:38,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:06:38,140 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 20 states, 19 states have (on average 14.052631578947368) internal successors, (267), 20 states have internal predecessors, (267), 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-17 15:06:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:38,449 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2025-03-17 15:06:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:06:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.052631578947368) internal successors, (267), 20 states have internal predecessors, (267), 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 133 [2025-03-17 15:06:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:38,452 INFO L225 Difference]: With dead ends: 236 [2025-03-17 15:06:38,452 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 15:06:38,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:06:38,457 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:38,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 199 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:06:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 15:06:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-17 15:06:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.0531400966183575) internal successors, (218), 210 states have internal predecessors, (218), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 15:06:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 260 transitions. [2025-03-17 15:06:38,474 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 260 transitions. Word has length 133 [2025-03-17 15:06:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 260 transitions. [2025-03-17 15:06:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.052631578947368) internal successors, (267), 20 states have internal predecessors, (267), 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-17 15:06:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 260 transitions. [2025-03-17 15:06:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 15:06:38,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:38,476 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2025-03-17 15:06:38,482 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-17 15:06:38,681 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,SelfDestructingSolverStorable16 [2025-03-17 15:06:38,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:38,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash -121467648, now seen corresponding path program 2 times [2025-03-17 15:06:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996387944] [2025-03-17 15:06:38,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:38,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-17 15:06:38,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 15:06:38,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:38,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:06:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:38,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996387944] [2025-03-17 15:06:38,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996387944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:38,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238695516] [2025-03-17 15:06:38,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:38,873 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-17 15:06:38,874 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-17 15:06:38,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-17 15:06:38,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 15:06:38,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:38,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:38,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:06:38,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:06:39,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 15:06:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238695516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:39,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 15:06:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464584223] [2025-03-17 15:06:39,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:06:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:39,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:06:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:06:39,487 INFO L87 Difference]: Start difference. First operand 233 states and 260 transitions. Second operand has 22 states, 21 states have (on average 14.047619047619047) internal successors, (295), 22 states have internal predecessors, (295), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:06:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:39,839 INFO L93 Difference]: Finished difference Result 254 states and 281 transitions. [2025-03-17 15:06:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:06:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.047619047619047) internal successors, (295), 22 states have internal predecessors, (295), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 157 [2025-03-17 15:06:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:39,841 INFO L225 Difference]: With dead ends: 254 [2025-03-17 15:06:39,841 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 15:06:39,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:06:39,842 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:39,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 300 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:06:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 15:06:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2025-03-17 15:06:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 221 states have (on average 1.0452488687782806) internal successors, (231), 224 states have internal predecessors, (231), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:06:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 277 transitions. [2025-03-17 15:06:39,851 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 277 transitions. Word has length 157 [2025-03-17 15:06:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:39,851 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 277 transitions. [2025-03-17 15:06:39,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.047619047619047) internal successors, (295), 22 states have internal predecessors, (295), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:06:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 277 transitions. [2025-03-17 15:06:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 15:06:39,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:39,852 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 15:06:39,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 15:06:40,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:06:40,053 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:40,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1071296037, now seen corresponding path program 2 times [2025-03-17 15:06:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284000996] [2025-03-17 15:06:40,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:40,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-17 15:06:40,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 15:06:40,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852601953] [2025-03-17 15:06:40,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:40,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:40,086 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-17 15:06:40,088 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-17 15:06:40,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-17 15:06:40,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 15:06:40,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:40,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:40,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:06:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 15:06:40,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 15:06:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284000996] [2025-03-17 15:06:40,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852601953] [2025-03-17 15:06:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852601953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:40,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:06:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 15:06:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599799681] [2025-03-17 15:06:40,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:40,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:06:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:40,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:06:40,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:06:40,595 INFO L87 Difference]: Start difference. First operand 249 states and 277 transitions. Second operand has 12 states, 11 states have (on average 23.363636363636363) internal successors, (257), 12 states have internal predecessors, (257), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-17 15:06:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:40,905 INFO L93 Difference]: Finished difference Result 351 states and 386 transitions. [2025-03-17 15:06:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:06:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.363636363636363) internal successors, (257), 12 states have internal predecessors, (257), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 192 [2025-03-17 15:06:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:40,907 INFO L225 Difference]: With dead ends: 351 [2025-03-17 15:06:40,907 INFO L226 Difference]: Without dead ends: 350 [2025-03-17 15:06:40,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:06:40,907 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:40,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 646 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:06:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-17 15:06:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 340. [2025-03-17 15:06:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 304 states have (on average 1.0460526315789473) internal successors, (318), 307 states have internal predecessors, (318), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 15:06:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 380 transitions. [2025-03-17 15:06:40,920 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 380 transitions. Word has length 192 [2025-03-17 15:06:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:40,920 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 380 transitions. [2025-03-17 15:06:40,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.363636363636363) internal successors, (257), 12 states have internal predecessors, (257), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-17 15:06:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 380 transitions. [2025-03-17 15:06:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 15:06:40,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:40,921 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 15:06:40,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:06:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:41,122 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -643205718, now seen corresponding path program 2 times [2025-03-17 15:06:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-03-17 15:06:41,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:41,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-17 15:06:41,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 15:06:41,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:41,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:06:41,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875762269] [2025-03-17 15:06:41,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:41,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:41,154 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-17 15:06:41,155 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-17 15:06:41,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-17 15:06:41,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 15:06:41,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:41,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:41,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:06:41,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 15:06:41,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 15:06:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-03-17 15:06:41,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:06:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875762269] [2025-03-17 15:06:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875762269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:41,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:06:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 15:06:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892596031] [2025-03-17 15:06:41,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:41,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:06:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:41,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:06:41,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:06:41,601 INFO L87 Difference]: Start difference. First operand 340 states and 380 transitions. Second operand has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 12 states have internal predecessors, (261), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 15:06:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:41,932 INFO L93 Difference]: Finished difference Result 346 states and 385 transitions. [2025-03-17 15:06:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:06:41,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 12 states have internal predecessors, (261), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 199 [2025-03-17 15:06:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:41,937 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:06:41,937 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 15:06:41,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:06:41,938 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 98 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:41,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 625 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:06:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 15:06:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-03-17 15:06:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 306 states have (on average 1.0294117647058822) internal successors, (315), 309 states have internal predecessors, (315), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:06:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 379 transitions. [2025-03-17 15:06:41,955 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 379 transitions. Word has length 199 [2025-03-17 15:06:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:41,956 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 379 transitions. [2025-03-17 15:06:41,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 12 states have internal predecessors, (261), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 15:06:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 379 transitions. [2025-03-17 15:06:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-17 15:06:41,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:41,961 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2025-03-17 15:06:41,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:06:42,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:42,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1834147910, now seen corresponding path program 2 times [2025-03-17 15:06:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-03-17 15:06:42,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:42,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 309 statements into 2 equivalence classes. [2025-03-17 15:06:42,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 309 of 309 statements. [2025-03-17 15:06:42,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:42,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-17 15:06:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-03-17 15:06:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552262584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041675423] [2025-03-17 15:06:42,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:06:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:42,305 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-17 15:06:42,306 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-17 15:06:42,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 309 statements into 2 equivalence classes. [2025-03-17 15:06:42,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 309 of 309 statements. [2025-03-17 15:06:42,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:06:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:42,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:06:42,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-17 15:06:42,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-17 15:06:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041675423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:06:42,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:06:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 15:06:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530510317] [2025-03-17 15:06:42,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:06:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:06:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:06:42,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:06:42,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:06:42,908 INFO L87 Difference]: Start difference. First operand 343 states and 379 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:06:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:06:42,997 INFO L93 Difference]: Finished difference Result 343 states and 379 transitions. [2025-03-17 15:06:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:06:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 309 [2025-03-17 15:06:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:06:42,999 INFO L225 Difference]: With dead ends: 343 [2025-03-17 15:06:42,999 INFO L226 Difference]: Without dead ends: 342 [2025-03-17 15:06:42,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:06:43,000 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 125 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:06:43,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:06:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-17 15:06:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-17 15:06:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 306 states have (on average 1.0163398692810457) internal successors, (311), 308 states have internal predecessors, (311), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:06:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 375 transitions. [2025-03-17 15:06:43,013 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 375 transitions. Word has length 309 [2025-03-17 15:06:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:06:43,013 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 375 transitions. [2025-03-17 15:06:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:06:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 375 transitions. [2025-03-17 15:06:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-17 15:06:43,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:06:43,016 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1] [2025-03-17 15:06:43,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:06:43,216 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,SelfDestructingSolverStorable20 [2025-03-17 15:06:43,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:06:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:06:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1368078112, now seen corresponding path program 3 times [2025-03-17 15:06:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:06:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295733922] [2025-03-17 15:06:43,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:06:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:06:43,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 333 statements into 13 equivalence classes. [2025-03-17 15:06:43,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 118 of 333 statements. [2025-03-17 15:06:43,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 15:06:43,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 51 proven. 414 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-17 15:06:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:06:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295733922] [2025-03-17 15:06:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295733922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:06:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164179279] [2025-03-17 15:06:43,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:06:43,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:06:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:06:43,400 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-17 15:06:43,402 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-17 15:06:43,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 333 statements into 13 equivalence classes. [2025-03-17 15:06:43,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 41 of 333 statements. [2025-03-17 15:06:43,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 15:06:43,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:06:43,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:06:43,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:06:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 126 proven. 148 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2025-03-17 15:06:43,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:06:51,996 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:07:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164179279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:07:05,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:07:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-17 15:07:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137459097] [2025-03-17 15:07:05,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:07:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:07:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:07:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:07:05,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:07:05,268 INFO L87 Difference]: Start difference. First operand 342 states and 375 transitions. Second operand has 16 states, 15 states have (on average 7.933333333333334) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-17 15:07:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:07:05,711 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2025-03-17 15:07:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:07:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.933333333333334) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 333 [2025-03-17 15:07:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:07:05,714 INFO L225 Difference]: With dead ends: 342 [2025-03-17 15:07:05,714 INFO L226 Difference]: Without dead ends: 341 [2025-03-17 15:07:05,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:07:05,717 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 320 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:07:05,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 56 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:07:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-17 15:07:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-17 15:07:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 306 states have (on average 1.0065359477124183) internal successors, (308), 307 states have internal predecessors, (308), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:07:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 372 transitions. [2025-03-17 15:07:05,744 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 372 transitions. Word has length 333 [2025-03-17 15:07:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:07:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 372 transitions. [2025-03-17 15:07:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.933333333333334) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-17 15:07:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 372 transitions. [2025-03-17 15:07:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 15:07:05,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:07:05,747 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-17 15:07:05,759 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-17 15:07:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:07:05,948 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-17 15:07:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:07:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1606710101, now seen corresponding path program 3 times [2025-03-17 15:07:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:07:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359546400] [2025-03-17 15:07:05,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:07:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:07:05,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 456 statements into 16 equivalence classes. [2025-03-17 15:07:06,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 15:07:06,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-17 15:07:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:07:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106500113] [2025-03-17 15:07:06,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:07:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:07:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:07:06,102 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-17 15:07:06,103 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-17 15:07:06,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 456 statements into 16 equivalence classes. [2025-03-17 15:07:06,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 65 of 456 statements. [2025-03-17 15:07:06,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:07:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:07:06,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:07:06,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:07:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 228 proven. 164 refuted. 0 times theorem prover too weak. 3018 trivial. 0 not checked. [2025-03-17 15:07:06,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:07:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:07:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359546400] [2025-03-17 15:07:39,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:07:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106500113] [2025-03-17 15:07:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106500113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:07:39,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:07:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 15:07:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896620958] [2025-03-17 15:07:39,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:07:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:07:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:07:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:07:39,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=241, Unknown=3, NotChecked=0, Total=306 [2025-03-17 15:07:39,231 INFO L87 Difference]: Start difference. First operand 341 states and 372 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:07:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:07:39,611 INFO L93 Difference]: Finished difference Result 343 states and 374 transitions. [2025-03-17 15:07:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:07:39,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 456 [2025-03-17 15:07:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:07:39,612 INFO L225 Difference]: With dead ends: 343 [2025-03-17 15:07:39,612 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:07:39,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=141, Invalid=408, Unknown=3, NotChecked=0, Total=552 [2025-03-17 15:07:39,612 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 165 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:07:39,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 39 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:07:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:07:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:07:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:07:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:07:39,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 456 [2025-03-17 15:07:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:07:39,613 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:07:39,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:07:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:07:39,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:07:39,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-03-17 15:07:39,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-03-17 15:07:39,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-03-17 15:07:39,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-03-17 15:07:39,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-03-17 15:07:39,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 15:07:39,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:07:39,826 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:07:39,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:07:40,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:07:40,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:07:40 BoogieIcfgContainer [2025-03-17 15:07:40,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:07:40,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:07:40,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:07:40,807 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:07:40,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:06:26" (3/4) ... [2025-03-17 15:07:40,808 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:07:40,812 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:07:40,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:07:40,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:07:40,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:07:40,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:07:40,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:07:40,869 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:07:40,869 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:07:40,869 INFO L158 Benchmark]: Toolchain (without parser) took 74521.86ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.5MB in the beginning and 139.0MB in the end (delta: -33.6MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,869 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.24ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: IcfgBuilder took 347.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 72.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: TraceAbstraction took 73883.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 72.8MB in the beginning and 147.2MB in the end (delta: -74.4MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,870 INFO L158 Benchmark]: Witness Printer took 62.27ms. Allocated memory is still 318.8MB. Free memory was 147.2MB in the beginning and 139.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:07:40,871 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.24ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 72.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 73883.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 72.8MB in the beginning and 147.2MB in the end (delta: -74.4MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. * Witness Printer took 62.27ms. Allocated memory is still 318.8MB. Free memory was 147.2MB in the beginning and 139.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 128 edges, 50 error locations. Started 1 CEGAR loops. OverallTime: 72.9s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2634 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2575 mSDsluCounter, 4497 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3052 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3656 IncrementalHoareTripleChecker+Invalid, 3981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 1445 mSDtfsCounter, 3656 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3661 GetRequests, 3458 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=20, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 384 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 59.9s InterpolantComputationTime, 4601 NumberOfCodeBlocks, 3703 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4848 ConstructedInterpolants, 4 QuantifiedInterpolants, 18352 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2533 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 13622/16383 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 50 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((n <= 2147483647) && (t == 1)) && (a == 0)) && (s == 1)) || ((((((((n <= 2147483647) && (((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0)) && (((__int128) t + 1) <= s)) && (3 <= t)) && (a <= 4611686018427387903)) && (((((((__int128) t * t) + ((__int128) -2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) : ((((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) - 1)) <= 2147483647)) && (0 <= a)) && (s <= ((__int128) 2147483647 + t)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:07:40,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE