./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/loop-lit/bh2017-ex1-poly.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:33:05,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:33:05,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:33:05,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:33:05,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:33:05,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:33:05,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:33:05,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:33:05,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:33:05,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:33:05,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:33:05,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:33:05,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:33:05,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:33:05,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:33:05,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:33:05,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:33:05,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:33:05,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:33:05,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:33:05,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:33:05,343 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 ! call(reach_error())) ) 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2025-03-03 13:33:05,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:33:05,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:33:05,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:33:05,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:33:05,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:33:05,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2025-03-03 13:33:06,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d820b1c7/871517c39a824969822d993c8daed48a/FLAGfd13d56b9 [2025-03-03 13:33:06,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:33:06,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2025-03-03 13:33:06,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d820b1c7/871517c39a824969822d993c8daed48a/FLAGfd13d56b9 [2025-03-03 13:33:07,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d820b1c7/871517c39a824969822d993c8daed48a [2025-03-03 13:33:07,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:33:07,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:33:07,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:33:07,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:33:07,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:33:07,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07, skipping insertion in model container [2025-03-03 13:33:07,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:33:07,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2025-03-03 13:33:07,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:33:07,407 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:33:07,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2025-03-03 13:33:07,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:33:07,431 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:33:07,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07 WrapperNode [2025-03-03 13:33:07,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:33:07,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:33:07,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:33:07,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:33:07,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,454 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-03-03 13:33:07,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:33:07,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:33:07,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:33:07,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:33:07,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:33:07,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:33:07,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:33:07,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:33:07,487 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:33:07,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (1/1) ... [2025-03-03 13:33:07,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:33:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:07,510 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-03 13:33:07,514 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-03 13:33:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:33:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:33:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:33:07,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:33:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:33:07,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:33:07,585 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:33:07,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:33:07,708 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 13:33:07,709 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:33:07,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:33:07,716 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:33:07,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:07 BoogieIcfgContainer [2025-03-03 13:33:07,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:33:07,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:33:07,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:33:07,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:33:07,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:33:07" (1/3) ... [2025-03-03 13:33:07,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:33:07, skipping insertion in model container [2025-03-03 13:33:07,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:07" (2/3) ... [2025-03-03 13:33:07,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:33:07, skipping insertion in model container [2025-03-03 13:33:07,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:07" (3/3) ... [2025-03-03 13:33:07,726 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2025-03-03 13:33:07,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:33:07,740 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex1-poly.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:33:07,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:33:07,795 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;@1abf60f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:33:07,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:33:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:33:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:33:07,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:07,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:07,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1148404653, now seen corresponding path program 1 times [2025-03-03 13:33:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164061704] [2025-03-03 13:33:07,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:07,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:33:07,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:33:07,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:07,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:07,989 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-03 13:33:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164061704] [2025-03-03 13:33:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164061704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:07,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:33:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682697171] [2025-03-03 13:33:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:33:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:08,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:33:08,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:08,006 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:33:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:08,100 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2025-03-03 13:33:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:08,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:33:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:08,105 INFO L225 Difference]: With dead ends: 47 [2025-03-03 13:33:08,105 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:33:08,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:08,108 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:08,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:33:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:33:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 13:33:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:33:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 13:33:08,136 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2025-03-03 13:33:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:08,136 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 13:33:08,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:33:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 13:33:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:33:08,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:08,137 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:33:08,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:08,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1162143048, now seen corresponding path program 1 times [2025-03-03 13:33:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450098946] [2025-03-03 13:33:08,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:33:08,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:33:08,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:08,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:08,266 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-03 13:33:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:08,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450098946] [2025-03-03 13:33:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450098946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:08,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:33:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404900345] [2025-03-03 13:33:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:08,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:33:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:08,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:33:08,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:08,269 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:33:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:08,356 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-03 13:33:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:33:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-03 13:33:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:08,357 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:33:08,360 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:33:08,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:33:08,361 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:08,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:33:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:33:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-03 13:33:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 13:33:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-03 13:33:08,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2025-03-03 13:33:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:08,376 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-03 13:33:08,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:33:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-03-03 13:33:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:33:08,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:08,377 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:08,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:33:08,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -474876723, now seen corresponding path program 1 times [2025-03-03 13:33:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856954409] [2025-03-03 13:33:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:08,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:33:08,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:33:08,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:08,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:33:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856954409] [2025-03-03 13:33:08,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856954409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:08,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:08,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:33:08,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037887024] [2025-03-03 13:33:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:08,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:33:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:08,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:33:08,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:08,487 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:08,547 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-03-03 13:33:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:33:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-03 13:33:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:08,548 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:33:08,549 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 13:33:08,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:33:08,549 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:08,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 13:33:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-03 13:33:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:33:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-03-03 13:33:08,556 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2025-03-03 13:33:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:08,557 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-03 13:33:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-03-03 13:33:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:33:08,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:08,557 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:08,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:33:08,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1125271384, now seen corresponding path program 1 times [2025-03-03 13:33:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122295085] [2025-03-03 13:33:08,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:33:08,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:33:08,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:08,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:33:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122295085] [2025-03-03 13:33:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122295085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:33:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772723710] [2025-03-03 13:33:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:33:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:08,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:33:08,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:08,657 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:33:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:08,709 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-03-03 13:33:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:08,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-03 13:33:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:08,716 INFO L225 Difference]: With dead ends: 89 [2025-03-03 13:33:08,716 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:33:08,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:08,717 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:08,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:33:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 13:33:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 13:33:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-03-03 13:33:08,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2025-03-03 13:33:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-03-03 13:33:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:33:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-03-03 13:33:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:33:08,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:08,732 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:33:08,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:08,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2125931280, now seen corresponding path program 1 times [2025-03-03 13:33:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033422430] [2025-03-03 13:33:08,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 13:33:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:33:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:08,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 13:33:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033422430] [2025-03-03 13:33:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033422430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:33:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891271744] [2025-03-03 13:33:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:33:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:33:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:33:08,794 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 13:33:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:08,834 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-03-03 13:33:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:33:08,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2025-03-03 13:33:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:08,837 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:33:08,837 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:33:08,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 13:33:08,838 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:08,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:33:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 13:33:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 13:33:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-03-03 13:33:08,849 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2025-03-03 13:33:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-03 13:33:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 13:33:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-03-03 13:33:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 13:33:08,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:08,850 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:33:08,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1891674588, now seen corresponding path program 1 times [2025-03-03 13:33:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865425913] [2025-03-03 13:33:08,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:08,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 13:33:08,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 13:33:08,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 13:33:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865425913] [2025-03-03 13:33:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865425913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744245704] [2025-03-03 13:33:09,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:09,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:09,092 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-03 13:33:09,093 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-03 13:33:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 13:33:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 13:33:09,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:09,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:33:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 13:33:09,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 13:33:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744245704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:09,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2025-03-03 13:33:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709139395] [2025-03-03 13:33:09,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:33:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:09,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:33:09,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:33:09,753 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-03 13:33:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:09,995 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-03-03 13:33:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:33:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 78 [2025-03-03 13:33:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:09,997 INFO L225 Difference]: With dead ends: 80 [2025-03-03 13:33:09,997 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 13:33:09,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:33:09,998 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:09,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 252 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:33:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 13:33:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2025-03-03 13:33:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 13:33:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-03 13:33:10,015 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 78 [2025-03-03 13:33:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:10,015 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-03 13:33:10,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-03 13:33:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-03 13:33:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 13:33:10,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:10,018 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:10,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:33:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 13:33:10,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 528346297, now seen corresponding path program 2 times [2025-03-03 13:33:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21004878] [2025-03-03 13:33:10,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:33:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:10,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-03 13:33:10,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 13:33:10,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:33:10,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-03 13:33:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21004878] [2025-03-03 13:33:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21004878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:10,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:10,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:33:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740102009] [2025-03-03 13:33:10,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:10,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:33:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:10,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:33:10,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:10,337 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 13:33:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:10,388 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-03 13:33:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:10,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-03-03 13:33:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:10,389 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:33:10,389 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:33:10,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:10,390 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:10,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:33:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:33:10,391 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-03 13:33:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:33:10,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2025-03-03 13:33:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:33:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 13:33:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:33:10,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:33:10,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:33:10,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:33:10,398 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-03 13:33:10,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:33:10,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:33:10,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:33:10 BoogieIcfgContainer [2025-03-03 13:33:10,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:33:10,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:33:10,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:33:10,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:33:10,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:07" (3/4) ... [2025-03-03 13:33:10,770 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:33:10,774 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 13:33:10,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 13:33:10,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:33:10,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:33:10,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:33:10,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:33:10,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:33:10,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:33:10,832 INFO L158 Benchmark]: Toolchain (without parser) took 3570.88ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 111.2MB in the end (delta: 13.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-03-03 13:33:10,833 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:10,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.08ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 113.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:33:10,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.04ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:10,834 INFO L158 Benchmark]: Boogie Preprocessor took 30.72ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.6MB in the end (delta: 762.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:10,834 INFO L158 Benchmark]: IcfgBuilder took 229.83ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 100.1MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:33:10,835 INFO L158 Benchmark]: TraceAbstraction took 3049.54ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 117.4MB in the end (delta: -18.0MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-03 13:33:10,835 INFO L158 Benchmark]: Witness Printer took 63.40ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 111.2MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:10,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.08ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 113.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.04ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.72ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.6MB in the end (delta: 762.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 229.83ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 100.1MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3049.54ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 117.4MB in the end (delta: -18.0MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 63.40ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 111.2MB in the end (delta: 4.6MB). There was no memory consumed. 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: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 774 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 595 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 179 mSDtfsCounter, 565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 150 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, InterpolantAutomatonStates: 51, 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, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 1 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 1573/1599 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 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 18]: Location Invariant Derived location invariant: ((((((2 == j) && (i == 1)) || ((i == 0) && (j == 0))) || ((((j <= 4) && (((long long) 2 * i) <= ((long long) 6 + j))) && (2 <= j)) && (((long long) 2 + j) <= ((long long) 2 * i)))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((j <= 4) && (j == ((long long) 2 * i))) && (2 <= i))) RESULT: Ultimate proved your program to be correct! [2025-03-03 13:33:10,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE