./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -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 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:24:50,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:24:50,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:24:50,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:24:50,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:24:50,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:24:50,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:24:50,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:24:50,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:24:50,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:24:50,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:24:50,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:24:50,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:24:50,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:24:50,398 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:24:50,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:24:50,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:24:50,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:24:50,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:24:50,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:24:50,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:24:50,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:24:50,400 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 -> 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 [2025-03-04 10:24:50,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:24:50,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:24:50,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:24:50,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:24:50,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:24:50,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2025-03-04 10:24:51,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d80b86/1e4db5bfcf194d7e8fb82af48afbcbff/FLAG41cc218e7 [2025-03-04 10:24:52,121 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:24:52,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2025-03-04 10:24:52,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d80b86/1e4db5bfcf194d7e8fb82af48afbcbff/FLAG41cc218e7 [2025-03-04 10:24:52,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d80b86/1e4db5bfcf194d7e8fb82af48afbcbff [2025-03-04 10:24:52,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:24:52,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:24:52,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:24:52,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:24:52,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:24:52,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd5dcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52, skipping insertion in model container [2025-03-04 10:24:52,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:24:52,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:24:52,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:24:52,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:24:52,417 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:24:52,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52 WrapperNode [2025-03-04 10:24:52,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:24:52,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:24:52,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:24:52,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:24:52,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,446 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2025-03-04 10:24:52,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:24:52,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:24:52,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:24:52,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:24:52,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,468 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-04 10:24:52,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:24:52,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:24:52,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:24:52,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:24:52,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (1/1) ... [2025-03-04 10:24:52,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:24:52,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:52,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:24:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:24:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:24:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:24:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:24:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:24:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:24:52,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:24:52,592 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:24:52,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:24:52,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-04 10:24:52,723 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 10:24:52,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:24:52,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:24:52,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:24:52,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:24:52 BoogieIcfgContainer [2025-03-04 10:24:52,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:24:52,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:24:52,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:24:52,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:24:52,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:24:52" (1/3) ... [2025-03-04 10:24:52,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a369040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:24:52, skipping insertion in model container [2025-03-04 10:24:52,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:52" (2/3) ... [2025-03-04 10:24:52,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a369040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:24:52, skipping insertion in model container [2025-03-04 10:24:52,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:24:52" (3/3) ... [2025-03-04 10:24:52,739 INFO L128 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca-2.i [2025-03-04 10:24:52,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:24:52,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubblesort-alloca-2.i that has 1 procedures, 41 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-03-04 10:24:52,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:24:52,802 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;@53331a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:24:52,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 10:24:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:24:52,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:52,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:24:52,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2077225154, now seen corresponding path program 1 times [2025-03-04 10:24:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231717323] [2025-03-04 10:24:52,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:52,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:24:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:24:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231717323] [2025-03-04 10:24:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231717323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:24:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35352837] [2025-03-04 10:24:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:53,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,036 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 40 states have internal predecessors, (45), 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:53,071 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-03-04 10:24:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:53,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:24:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:53,079 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:24:53,079 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:24:53,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,084 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:53,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:24:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:24:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-04 10:24:53,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-03-04 10:24:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:53,108 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-04 10:24:53,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-04 10:24:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:24:53,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:53,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:24:53,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:24:53,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:53,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2077224994, now seen corresponding path program 1 times [2025-03-04 10:24:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223790121] [2025-03-04 10:24:53,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:53,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:24:53,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:24:53,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223790121] [2025-03-04 10:24:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223790121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:53,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755472770] [2025-03-04 10:24:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:53,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:53,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,209 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:53,235 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-03-04 10:24:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:24:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:53,236 INFO L225 Difference]: With dead ends: 42 [2025-03-04 10:24:53,237 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:24:53,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,237 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:53,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:24:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 10:24:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-04 10:24:53,241 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 6 [2025-03-04 10:24:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:53,241 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-04 10:24:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-04 10:24:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:24:53,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:53,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:53,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:24:53,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash -720989562, now seen corresponding path program 1 times [2025-03-04 10:24:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034705834] [2025-03-04 10:24:53,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:53,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034705834] [2025-03-04 10:24:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034705834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69681770] [2025-03-04 10:24:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:53,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:53,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,340 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:53,358 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-03-04 10:24:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-04 10:24:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:53,359 INFO L225 Difference]: With dead ends: 40 [2025-03-04 10:24:53,359 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:24:53,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,360 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:53,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:24:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 10:24:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-04 10:24:53,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 9 [2025-03-04 10:24:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:53,363 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-04 10:24:53,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-03-04 10:24:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:24:53,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:53,367 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:24:53,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash -720989402, now seen corresponding path program 1 times [2025-03-04 10:24:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926860604] [2025-03-04 10:24:53,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:53,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:53,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926860604] [2025-03-04 10:24:53,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926860604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316267630] [2025-03-04 10:24:53,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:53,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:53,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:24:53,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:53,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:53,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:24:53,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:53,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316267630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:53,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:53,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:24:53,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802880577] [2025-03-04 10:24:53,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:53,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:53,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:24:53,564 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:53,604 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-04 10:24:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:24:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2025-03-04 10:24:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:53,605 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:24:53,605 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:24:53,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:24:53,605 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:53,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:24:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:24:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-04 10:24:53,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2025-03-04 10:24:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:53,609 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-04 10:24:53,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-04 10:24:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:24:53,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:53,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:53,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:53,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:53,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:53,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -875839941, now seen corresponding path program 1 times [2025-03-04 10:24:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352496891] [2025-03-04 10:24:53,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:53,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:24:53,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:24:53,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352496891] [2025-03-04 10:24:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352496891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74969120] [2025-03-04 10:24:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:53,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,897 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:53,913 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-04 10:24:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:24:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:53,913 INFO L225 Difference]: With dead ends: 49 [2025-03-04 10:24:53,913 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:24:53,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:53,915 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:53,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:24:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-04 10:24:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-03-04 10:24:53,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 10 [2025-03-04 10:24:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-03-04 10:24:53,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-03-04 10:24:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:24:53,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:53,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:53,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:24:53,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:53,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash -875834976, now seen corresponding path program 1 times [2025-03-04 10:24:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136083526] [2025-03-04 10:24:53,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:53,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:24:53,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:24:53,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:53,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136083526] [2025-03-04 10:24:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136083526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:54,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788733106] [2025-03-04 10:24:54,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:54,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:54,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:24:54,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:24:54,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:24:54,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:24:54,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:54,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788733106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:54,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-04 10:24:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739140833] [2025-03-04 10:24:54,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:24:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:24:54,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:24:54,128 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,175 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-03-04 10:24:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:24:54,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:24:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,177 INFO L225 Difference]: With dead ends: 84 [2025-03-04 10:24:54,177 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 10:24:54,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:24:54,181 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 10:24:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 10:24:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-04 10:24:54,188 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 10 [2025-03-04 10:24:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,188 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-04 10:24:54,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-04 10:24:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:24:54,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:54,389 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,SelfDestructingSolverStorable5 [2025-03-04 10:24:54,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 866970394, now seen corresponding path program 1 times [2025-03-04 10:24:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628482997] [2025-03-04 10:24:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:24:54,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:24:54,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628482997] [2025-03-04 10:24:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628482997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146344918] [2025-03-04 10:24:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:54,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,435 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,452 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-03-04 10:24:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:24:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,453 INFO L225 Difference]: With dead ends: 54 [2025-03-04 10:24:54,453 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:24:54,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,454 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:24:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-04 10:24:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.45) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-04 10:24:54,460 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 10 [2025-03-04 10:24:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,460 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-04 10:24:54,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-04 10:24:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:24:54,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:24:54,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -221360798, now seen corresponding path program 1 times [2025-03-04 10:24:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497894645] [2025-03-04 10:24:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:24:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:24:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497894645] [2025-03-04 10:24:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497894645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921888397] [2025-03-04 10:24:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:54,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,493 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,504 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-03-04 10:24:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-04 10:24:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,505 INFO L225 Difference]: With dead ends: 51 [2025-03-04 10:24:54,505 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 10:24:54,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,505 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 10:24:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 10:24:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.425) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-04 10:24:54,509 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2025-03-04 10:24:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,509 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-04 10:24:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-04 10:24:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:24:54,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:24:54,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -221360158, now seen corresponding path program 1 times [2025-03-04 10:24:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310083362] [2025-03-04 10:24:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:24:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:24:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310083362] [2025-03-04 10:24:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310083362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866629657] [2025-03-04 10:24:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:54,536 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,563 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-04 10:24:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-04 10:24:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,564 INFO L225 Difference]: With dead ends: 65 [2025-03-04 10:24:54,564 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:24:54,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:54,564 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:24:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-04 10:24:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-04 10:24:54,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 13 [2025-03-04 10:24:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,569 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-04 10:24:54,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-04 10:24:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:24:54,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:24:54,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1727749828, now seen corresponding path program 1 times [2025-03-04 10:24:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-03-04 10:24:54,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:24:54,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:24:54,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-03-04 10:24:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529447059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:54,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:54,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612494326] [2025-03-04 10:24:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:54,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,621 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,656 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2025-03-04 10:24:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:54,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-04 10:24:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,656 INFO L225 Difference]: With dead ends: 62 [2025-03-04 10:24:54,656 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 10:24:54,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,657 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 10:24:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-04 10:24:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.38) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-03-04 10:24:54,660 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 14 [2025-03-04 10:24:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-03-04 10:24:54,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-03-04 10:24:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:24:54,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:24:54,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1098692671, now seen corresponding path program 1 times [2025-03-04 10:24:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127189212] [2025-03-04 10:24:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:24:54,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:24:54,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127189212] [2025-03-04 10:24:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127189212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382342107] [2025-03-04 10:24:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:54,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,697 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:54,744 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-04 10:24:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:54,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-04 10:24:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:54,745 INFO L225 Difference]: With dead ends: 65 [2025-03-04 10:24:54,745 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 10:24:54,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:54,745 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:54,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 10:24:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 10:24:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2025-03-04 10:24:54,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2025-03-04 10:24:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:54,749 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2025-03-04 10:24:54,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2025-03-04 10:24:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:24:54,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:54,750 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-04 10:24:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:24:54,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:54,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1793125399, now seen corresponding path program 1 times [2025-03-04 10:24:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:54,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225752168] [2025-03-04 10:24:54,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:54,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:24:54,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:24:54,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225752168] [2025-03-04 10:24:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225752168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656040560] [2025-03-04 10:24:54,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:54,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:54,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:24:54,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:24:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:24:54,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:24:54,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:54,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656040560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:55,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 10:24:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002278666] [2025-03-04 10:24:55,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:24:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:24:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:24:55,070 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:55,140 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2025-03-04 10:24:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:24:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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 19 [2025-03-04 10:24:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:55,142 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:24:55,142 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 10:24:55,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:24:55,143 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:55,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 10:24:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 10:24:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.352112676056338) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-03-04 10:24:55,149 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 19 [2025-03-04 10:24:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:55,150 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-04 10:24:55,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-03-04 10:24:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:24:55,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:55,150 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:55,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:55,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:55,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -792421302, now seen corresponding path program 1 times [2025-03-04 10:24:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700230402] [2025-03-04 10:24:55,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:55,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:24:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:24:55,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:55,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700230402] [2025-03-04 10:24:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700230402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958911663] [2025-03-04 10:24:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:55,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:24:55,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:24:55,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:24:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:24:55,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:55,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958911663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2025-03-04 10:24:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423432117] [2025-03-04 10:24:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:55,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:55,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:24:55,488 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:55,509 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2025-03-04 10:24:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:24:55,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2025-03-04 10:24:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:55,510 INFO L225 Difference]: With dead ends: 121 [2025-03-04 10:24:55,510 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:24:55,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:24:55,511 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:55,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:24:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 10:24:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 84 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2025-03-04 10:24:55,518 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 20 [2025-03-04 10:24:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:55,518 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2025-03-04 10:24:55,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2025-03-04 10:24:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:24:55,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:55,518 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:55,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:55,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:55,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1789493655, now seen corresponding path program 1 times [2025-03-04 10:24:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360802811] [2025-03-04 10:24:55,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:55,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:55,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:24:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:24:55,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360802811] [2025-03-04 10:24:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360802811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426587841] [2025-03-04 10:24:55,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:55,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:55,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:55,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:24:55,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:24:55,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:24:55,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:55,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:55,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:24:55,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:55,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426587841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:55,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-04 10:24:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444775227] [2025-03-04 10:24:55,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:55,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:24:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:55,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:24:55,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:24:55,940 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:55,989 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2025-03-04 10:24:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:24:55,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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 20 [2025-03-04 10:24:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:55,989 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:24:55,990 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 10:24:55,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:24:55,990 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:55,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 10:24:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-03-04 10:24:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 84 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2025-03-04 10:24:55,998 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 20 [2025-03-04 10:24:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:55,998 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2025-03-04 10:24:55,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2025-03-04 10:24:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:24:55,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:55,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:56,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:56,199 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,SelfDestructingSolverStorable13 [2025-03-04 10:24:56,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:56,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1933002989, now seen corresponding path program 2 times [2025-03-04 10:24:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87332165] [2025-03-04 10:24:56,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:56,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:24:56,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:24:56,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87332165] [2025-03-04 10:24:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87332165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360953299] [2025-03-04 10:24:56,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:56,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:56,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:56,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:56,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:24:56,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:24:56,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:24:56,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:56,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:56,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:56,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:56,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360953299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:24:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401839931] [2025-03-04 10:24:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:24:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:56,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:24:56,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:56,326 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:56,367 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-03-04 10:24:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2025-03-04 10:24:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:56,368 INFO L225 Difference]: With dead ends: 85 [2025-03-04 10:24:56,368 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 10:24:56,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:56,369 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:56,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 10:24:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 10:24:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.28) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-03-04 10:24:56,372 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 23 [2025-03-04 10:24:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:56,372 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-04 10:24:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-03-04 10:24:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:24:56,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:56,373 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-04 10:24:56,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:24:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:24:56,577 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 206429619, now seen corresponding path program 1 times [2025-03-04 10:24:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413844691] [2025-03-04 10:24:56,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:56,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:24:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:24:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:24:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413844691] [2025-03-04 10:24:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413844691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895907721] [2025-03-04 10:24:56,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:56,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:56,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:56,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:24:56,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:24:56,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:24:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:56,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:24:56,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:24:56,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895907721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-04 10:24:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578320470] [2025-03-04 10:24:56,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:56,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:56,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:24:56,779 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:56,803 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-03-04 10:24:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:24:56,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2025-03-04 10:24:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:56,804 INFO L225 Difference]: With dead ends: 81 [2025-03-04 10:24:56,804 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:24:56,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:24:56,805 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:56,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:24:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-04 10:24:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.273972602739726) internal successors, (93), 77 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-03-04 10:24:56,808 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 24 [2025-03-04 10:24:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:56,808 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-03-04 10:24:56,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-03-04 10:24:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:24:56,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:56,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:56,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:57,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:57,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:57,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 206449479, now seen corresponding path program 1 times [2025-03-04 10:24:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766018255] [2025-03-04 10:24:57,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:57,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:24:57,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:24:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:57,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:57,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766018255] [2025-03-04 10:24:57,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766018255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:57,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103708460] [2025-03-04 10:24:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:57,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:57,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:57,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:57,036 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:57,052 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2025-03-04 10:24:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2025-03-04 10:24:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:57,053 INFO L225 Difference]: With dead ends: 78 [2025-03-04 10:24:57,053 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 10:24:57,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:57,053 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:57,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 10:24:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 10:24:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-03-04 10:24:57,058 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 24 [2025-03-04 10:24:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-03-04 10:24:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2025-03-04 10:24:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:24:57,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:57,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:57,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:24:57,061 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:57,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1759133957, now seen corresponding path program 1 times [2025-03-04 10:24:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034089928] [2025-03-04 10:24:57,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:57,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:24:57,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:24:57,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:57,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:24:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034089928] [2025-03-04 10:24:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034089928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245363826] [2025-03-04 10:24:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:57,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:57,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:24:57,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:24:57,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:24:57,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:57,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:24:57,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:57,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245363826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:57,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 19 [2025-03-04 10:24:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899116849] [2025-03-04 10:24:57,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:57,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:24:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:57,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:24:57,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:24:57,393 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:57,574 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-03-04 10:24:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:24:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 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 28 [2025-03-04 10:24:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:57,575 INFO L225 Difference]: With dead ends: 127 [2025-03-04 10:24:57,575 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:24:57,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:24:57,576 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:57,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 122 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:24:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 10:24:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2025-03-04 10:24:57,581 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 28 [2025-03-04 10:24:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2025-03-04 10:24:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2025-03-04 10:24:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 10:24:57,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:57,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:57,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:57,782 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,SelfDestructingSolverStorable17 [2025-03-04 10:24:57,783 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:57,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1443698773, now seen corresponding path program 1 times [2025-03-04 10:24:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648185298] [2025-03-04 10:24:57,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:24:57,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:24:57,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:57,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:24:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:57,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648185298] [2025-03-04 10:24:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648185298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:57,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:24:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714455375] [2025-03-04 10:24:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:57,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:57,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:57,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:57,851 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:57,890 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2025-03-04 10:24:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 36 [2025-03-04 10:24:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:57,891 INFO L225 Difference]: With dead ends: 141 [2025-03-04 10:24:57,891 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 10:24:57,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:57,891 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:57,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 10:24:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 10:24:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2025-03-04 10:24:57,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 36 [2025-03-04 10:24:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2025-03-04 10:24:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2025-03-04 10:24:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 10:24:57,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:57,895 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1] [2025-03-04 10:24:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:24:57,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1407138647, now seen corresponding path program 2 times [2025-03-04 10:24:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804216845] [2025-03-04 10:24:57,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:57,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:24:57,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-03-04 10:24:57,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:57,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 10:24:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804216845] [2025-03-04 10:24:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804216845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71716] [2025-03-04 10:24:57,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:57,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:57,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:24:57,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:24:57,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-03-04 10:24:57,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:57,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:57,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:57,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 10:24:58,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 10:24:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:58,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:58,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 10:24:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990775331] [2025-03-04 10:24:58,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:58,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:58,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:58,060 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:58,073 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-03-04 10:24:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 10:24:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:58,074 INFO L225 Difference]: With dead ends: 92 [2025-03-04 10:24:58,074 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 10:24:58,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:58,075 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:58,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 10:24:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2025-03-04 10:24:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-03-04 10:24:58,077 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 37 [2025-03-04 10:24:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-03-04 10:24:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-03-04 10:24:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:24:58,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:58,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:58,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:24:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:58,283 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 923518955, now seen corresponding path program 2 times [2025-03-04 10:24:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354208153] [2025-03-04 10:24:58,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:58,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:24:58,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 38 statements. [2025-03-04 10:24:58,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:58,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354208153] [2025-03-04 10:24:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354208153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680553760] [2025-03-04 10:24:58,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:58,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:58,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:58,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:24:58,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:24:58,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 38 statements. [2025-03-04 10:24:58,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:58,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:24:58,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:58,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680553760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:58,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-04 10:24:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221842807] [2025-03-04 10:24:58,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:58,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:24:58,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:24:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:58,495 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:58,558 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-03-04 10:24:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:24:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 38 [2025-03-04 10:24:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:58,559 INFO L225 Difference]: With dead ends: 103 [2025-03-04 10:24:58,559 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 10:24:58,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:24:58,559 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:58,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 49 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 10:24:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2025-03-04 10:24:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-03-04 10:24:58,562 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 38 [2025-03-04 10:24:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-03-04 10:24:58,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-03-04 10:24:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:24:58,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:58,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:58,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:58,763 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,SelfDestructingSolverStorable20 [2025-03-04 10:24:58,763 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash -6608380, now seen corresponding path program 1 times [2025-03-04 10:24:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426499979] [2025-03-04 10:24:58,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:58,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:24:58,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:24:58,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:58,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:24:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426499979] [2025-03-04 10:24:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426499979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150726566] [2025-03-04 10:24:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:58,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:58,901 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:58,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:24:58,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:24:58,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:24:58,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:58,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:58,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:24:58,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:24:59,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:24:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150726566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:59,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 16 [2025-03-04 10:24:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726754434] [2025-03-04 10:24:59,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:24:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:59,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:24:59,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:24:59,095 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:59,151 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2025-03-04 10:24:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:24:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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 46 [2025-03-04 10:24:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:59,152 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:24:59,152 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 10:24:59,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:24:59,156 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:59,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 10:24:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 10:24:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-03-04 10:24:59,158 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 46 [2025-03-04 10:24:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:59,158 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 10:24:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-03-04 10:24:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:24:59,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:59,159 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:59,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:59,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:24:59,364 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:24:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2014085678, now seen corresponding path program 2 times [2025-03-04 10:24:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458392898] [2025-03-04 10:24:59,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:59,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:24:59,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:24:59,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:59,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458392898] [2025-03-04 10:24:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458392898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034837610] [2025-03-04 10:24:59,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:59,499 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:59,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:24:59,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:24:59,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:24:59,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:59,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:59,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:24:59,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:59,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:24:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034837610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:59,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-04 10:24:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203917493] [2025-03-04 10:24:59,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:24:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:59,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:24:59,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:24:59,750 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:59,912 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2025-03-04 10:24:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:24:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 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 49 [2025-03-04 10:24:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:59,912 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:24:59,912 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:24:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:24:59,913 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:59,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 107 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:24:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2025-03-04 10:24:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-03-04 10:24:59,915 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 49 [2025-03-04 10:24:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:59,915 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-03-04 10:24:59,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-03-04 10:24:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:24:59,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:59,916 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:59,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:25:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:25:00,117 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 10:25:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:25:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -724904204, now seen corresponding path program 3 times [2025-03-04 10:25:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:25:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-04 10:25:00,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:25:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:25:00,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-04 10:25:00,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 56 statements. [2025-03-04 10:25:00,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:25:00,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:25:00,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:25:00,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-04 10:25:00,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254787401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:25:00,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650418939] [2025-03-04 10:25:00,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:25:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:25:00,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:25:00,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:25:00,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:25:00,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-04 10:25:00,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 56 statements. [2025-03-04 10:25:00,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:25:00,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:25:00,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:25:00,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:25:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:25:00,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:25:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650418939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:00,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 10:25:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445977252] [2025-03-04 10:25:00,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:00,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:25:00,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:00,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:25:00,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:25:00,400 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:25:00,529 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-03-04 10:25:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:25:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 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 56 [2025-03-04 10:25:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:25:00,529 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:25:00,529 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:25:00,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:25:00,530 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:25:00,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:25:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:25:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:25:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:25:00,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-03-04 10:25:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:25:00,531 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:25:00,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:25:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:25:00,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:25:00,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-04 10:25:00,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-04 10:25:00,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-04 10:25:00,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-04 10:25:00,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-04 10:25:00,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-04 10:25:00,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-04 10:25:00,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-04 10:25:00,543 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-04 10:25:00,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:25:00,740 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:25:00,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:25:00,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:25:00,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:25:00 BoogieIcfgContainer [2025-03-04 10:25:00,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:25:00,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:25:00,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:25:00,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:25:00,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:24:52" (3/4) ... [2025-03-04 10:25:00,873 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:25:00,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 10:25:00,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:25:00,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:25:00,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:25:00,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:25:00,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:25:00,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:25:00,945 INFO L158 Benchmark]: Toolchain (without parser) took 8802.52ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 68.8MB in the end (delta: 52.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2025-03-04 10:25:00,946 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:00,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.00ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 104.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:25:00,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.98ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:00,946 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:25:00,946 INFO L158 Benchmark]: IcfgBuilder took 255.74ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 88.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:25:00,947 INFO L158 Benchmark]: TraceAbstraction took 8135.98ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 75.1MB in the end (delta: 12.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-03-04 10:25:00,947 INFO L158 Benchmark]: Witness Printer took 73.14ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 68.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:25:00,948 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.00ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 104.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.98ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 255.74ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 88.7MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8135.98ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 75.1MB in the end (delta: 12.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 73.14ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 68.8MB in the end (delta: 6.3MB). 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: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 519]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 519]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 532]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 532]: 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 1 procedures, 41 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 24, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 2547 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1944 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1760 IncrementalHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 603 mSDtfsCounter, 1760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 591 SyntacticMatches, 38 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=18, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 64 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 916 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1173 ConstructedInterpolants, 0 QuantifiedInterpolants, 2871 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 46 InterpolantComputations, 15 PerfectInterpolantSequences, 1071/1412 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 14 specifications checked. All of them hold - InvariantResult [Line: 515]: Location Invariant Derived location invariant: ((i == 2147483646) || (i < 2147483646)) - InvariantResult [Line: 516]: Location Invariant Derived location invariant: (((((((2 <= i) && (2 <= j)) && (j <= 2147483647)) && (i <= 2147483646)) || (((2 <= i) && (j == 1)) && (i <= 2147483646))) || ((((i <= 2147483645) && (2 <= j)) && (0 <= i)) && (j <= 2147483646))) || (((i <= 2147483645) && (0 <= i)) && (j == 1))) - InvariantResult [Line: 532]: Location Invariant Derived location invariant: ((((((k == 1) && (array_size <= 2147483647)) && (1 <= array_size)) || (((2 <= k) && (array_size <= 2147483647)) && (3 <= array_size))) || (((array_size <= 2147483647) && (k == 0)) && (1 <= array_size))) || (((array_size <= 2147483647) && (2 == k)) && (1 <= array_size))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:25:00,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE