./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex-add.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 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:51:28,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:51:28,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:51:28,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:51:28,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:51:28,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:51:28,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:51:28,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:51:28,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:51:28,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:51:28,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:51:28,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:51:28,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:51:28,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:51:28,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:51:28,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:51:28,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:51:28,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:28,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:51:28,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:51:28,270 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2025-03-16 17:51:28,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:51:28,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:51:28,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:51:28,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:51:28,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:51:28,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-03-16 17:51:29,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f846468/6543ab51fefd4c2c91184f23e16efcc9/FLAG39acf3516 [2025-03-16 17:51:29,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:51:29,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-03-16 17:51:29,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f846468/6543ab51fefd4c2c91184f23e16efcc9/FLAG39acf3516 [2025-03-16 17:51:30,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f846468/6543ab51fefd4c2c91184f23e16efcc9 [2025-03-16 17:51:30,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:51:30,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:51:30,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:30,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:51:30,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:51:30,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f474378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30, skipping insertion in model container [2025-03-16 17:51:30,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:51:30,294 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-ex-add.i[802,815] [2025-03-16 17:51:30,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:30,314 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:51:30,323 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-ex-add.i[802,815] [2025-03-16 17:51:30,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:30,340 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:51:30,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30 WrapperNode [2025-03-16 17:51:30,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:30,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:30,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:51:30,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:51:30,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,363 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-16 17:51:30,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:30,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:51:30,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:51:30,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:51:30,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,377 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-16 17:51:30,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:51:30,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:51:30,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:51:30,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:51:30,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (1/1) ... [2025-03-16 17:51:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:30,409 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-16 17:51:30,411 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-16 17:51:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:51:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:51:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:51:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:51:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 17:51:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 17:51:30,463 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:51:30,464 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:51:30,562 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-16 17:51:30,562 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:51:30,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:51:30,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:51:30,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:30 BoogieIcfgContainer [2025-03-16 17:51:30,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:51:30,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:51:30,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:51:30,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:51:30,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:51:30" (1/3) ... [2025-03-16 17:51:30,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4487d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:30, skipping insertion in model container [2025-03-16 17:51:30,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:30" (2/3) ... [2025-03-16 17:51:30,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4487d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:30, skipping insertion in model container [2025-03-16 17:51:30,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:30" (3/3) ... [2025-03-16 17:51:30,575 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2025-03-16 17:51:30,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:51:30,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex-add.i that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:51:30,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:51:30,624 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;@77da155a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:51:30,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:51:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:51:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 17:51:30,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:30,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 17:51:30,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 49092523, now seen corresponding path program 1 times [2025-03-16 17:51:30,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408350012] [2025-03-16 17:51:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 17:51:30,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 17:51:30,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:30,834 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-16 17:51:30,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:30,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408350012] [2025-03-16 17:51:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408350012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:51:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649798886] [2025-03-16 17:51:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:51:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:30,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:51:30,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:51:30,861 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 17:51:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:30,937 INFO L93 Difference]: Finished difference Result 47 states and 72 transitions. [2025-03-16 17:51:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:51:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-16 17:51:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:30,943 INFO L225 Difference]: With dead ends: 47 [2025-03-16 17:51:30,943 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 17:51:30,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-16 17:51:30,946 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:30,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 17:51:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 17:51:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:51:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-16 17:51:30,971 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 5 [2025-03-16 17:51:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:30,971 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-16 17:51:30,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 17:51:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-16 17:51:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:51:30,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:30,972 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:51:30,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:30,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1782206415, now seen corresponding path program 1 times [2025-03-16 17:51:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214905643] [2025-03-16 17:51:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:30,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:51:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:51:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,048 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-16 17:51:31,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214905643] [2025-03-16 17:51:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214905643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:51:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364688541] [2025-03-16 17:51:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:31,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:51:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:31,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:51:31,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:51:31,053 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-16 17:51:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:31,090 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-03-16 17:51:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:51:31,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 10 [2025-03-16 17:51:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:31,091 INFO L225 Difference]: With dead ends: 31 [2025-03-16 17:51:31,092 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 17:51:31,092 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-16 17:51:31,092 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:31,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 17:51:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 17:51:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:51:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 17:51:31,098 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 10 [2025-03-16 17:51:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:31,098 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 17:51:31,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-16 17:51:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 17:51:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:51:31,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:31,098 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:51:31,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1951704168, now seen corresponding path program 1 times [2025-03-16 17:51:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516237901] [2025-03-16 17:51:31,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:51:31,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:51:31,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,165 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-16 17:51:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516237901] [2025-03-16 17:51:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516237901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:51:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869273822] [2025-03-16 17:51:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:31,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:51:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:31,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:51:31,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:51:31,167 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 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-16 17:51:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:31,178 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2025-03-16 17:51:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:51:31,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 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 19 [2025-03-16 17:51:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:31,179 INFO L225 Difference]: With dead ends: 69 [2025-03-16 17:51:31,179 INFO L226 Difference]: Without dead ends: 41 [2025-03-16 17:51:31,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 17:51:31,180 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:31,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-16 17:51:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-16 17:51:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 17:51:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2025-03-16 17:51:31,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 19 [2025-03-16 17:51:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:31,189 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2025-03-16 17:51:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 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-16 17:51:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2025-03-16 17:51:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:51:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:31,190 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:51:31,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -745138007, now seen corresponding path program 1 times [2025-03-16 17:51:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120733287] [2025-03-16 17:51:31,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:31,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:51:31,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:51:31,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,245 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-16 17:51:31,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120733287] [2025-03-16 17:51:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120733287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:51:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129532640] [2025-03-16 17:51:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:31,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:51:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:31,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:51:31,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:51:31,248 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 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-16 17:51:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:31,263 INFO L93 Difference]: Finished difference Result 103 states and 149 transitions. [2025-03-16 17:51:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:51:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 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 21 [2025-03-16 17:51:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:31,264 INFO L225 Difference]: With dead ends: 103 [2025-03-16 17:51:31,264 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 17:51:31,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:51:31,265 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:31,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 17:51:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-16 17:51:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 17:51:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2025-03-16 17:51:31,279 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 21 [2025-03-16 17:51:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:31,279 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2025-03-16 17:51:31,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 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-16 17:51:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2025-03-16 17:51:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:51:31,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:31,280 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:31,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:51:31,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2109942397, now seen corresponding path program 1 times [2025-03-16 17:51:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416594469] [2025-03-16 17:51:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:31,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:51:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:51:31,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416594469] [2025-03-16 17:51:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416594469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505848452] [2025-03-16 17:51:31,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:31,353 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-16 17:51:31,355 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-16 17:51:31,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:51:31,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:51:31,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:51:31,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505848452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:31,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 17:51:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694397847] [2025-03-16 17:51:31,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:51:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:31,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:51:31,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:31,520 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-16 17:51:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:31,571 INFO L93 Difference]: Finished difference Result 191 states and 297 transitions. [2025-03-16 17:51:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:51:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2025-03-16 17:51:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:31,573 INFO L225 Difference]: With dead ends: 191 [2025-03-16 17:51:31,573 INFO L226 Difference]: Without dead ends: 129 [2025-03-16 17:51:31,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:31,574 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:31,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 123 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-16 17:51:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-16 17:51:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-16 17:51:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 200 transitions. [2025-03-16 17:51:31,598 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 200 transitions. Word has length 35 [2025-03-16 17:51:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 200 transitions. [2025-03-16 17:51:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-16 17:51:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2025-03-16 17:51:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:51:31,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:31,601 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:31,607 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-16 17:51:31,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:31,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:31,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2100722850, now seen corresponding path program 1 times [2025-03-16 17:51:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:31,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254519534] [2025-03-16 17:51:31,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:31,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:51:31,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:51:31,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254519534] [2025-03-16 17:51:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254519534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248561889] [2025-03-16 17:51:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:31,865 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-16 17:51:31,867 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-16 17:51:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:51:31,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:51:31,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:31,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:31,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:51:31,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:51:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248561889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:31,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 17:51:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638408879] [2025-03-16 17:51:31,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:31,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:51:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:31,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:51:31,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:31,997 INFO L87 Difference]: Start difference. First operand 129 states and 200 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:51:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:32,046 INFO L93 Difference]: Finished difference Result 413 states and 666 transitions. [2025-03-16 17:51:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:51:32,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 37 [2025-03-16 17:51:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:32,048 INFO L225 Difference]: With dead ends: 413 [2025-03-16 17:51:32,049 INFO L226 Difference]: Without dead ends: 285 [2025-03-16 17:51:32,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:32,052 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:32,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 121 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-16 17:51:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-16 17:51:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 221 states have (on average 1.502262443438914) internal successors, (332), 221 states have internal predecessors, (332), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 17:51:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 452 transitions. [2025-03-16 17:51:32,088 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 452 transitions. Word has length 37 [2025-03-16 17:51:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:32,089 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 452 transitions. [2025-03-16 17:51:32,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:51:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 452 transitions. [2025-03-16 17:51:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 17:51:32,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:32,096 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-16 17:51:32,102 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-16 17:51:32,296 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-16 17:51:32,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:32,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1238236996, now seen corresponding path program 2 times [2025-03-16 17:51:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408944222] [2025-03-16 17:51:32,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:32,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-16 17:51:32,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 17:51:32,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:32,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-16 17:51:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408944222] [2025-03-16 17:51:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408944222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:51:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172841834] [2025-03-16 17:51:32,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:32,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:32,485 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-16 17:51:32,487 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-16 17:51:32,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-16 17:51:32,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 17:51:32,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:32,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:51:32,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:51:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 17:51:32,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:51:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 17:51:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172841834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:51:32,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:51:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-16 17:51:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724671181] [2025-03-16 17:51:32,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:51:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:51:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:32,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:51:32,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:51:32,803 INFO L87 Difference]: Start difference. First operand 285 states and 452 transitions. Second operand has 17 states, 16 states have (on average 5.0) internal successors, (80), 17 states have internal predecessors, (80), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-16 17:51:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:32,981 INFO L93 Difference]: Finished difference Result 883 states and 1440 transitions. [2025-03-16 17:51:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 17:51:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 17 states have internal predecessors, (80), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 83 [2025-03-16 17:51:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:32,987 INFO L225 Difference]: With dead ends: 883 [2025-03-16 17:51:32,988 INFO L226 Difference]: Without dead ends: 599 [2025-03-16 17:51:32,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-16 17:51:32,990 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 155 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:32,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 261 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-16 17:51:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-16 17:51:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 469 states have (on average 1.5053304904051172) internal successors, (706), 468 states have internal predecessors, (706), 126 states have call successors, (126), 4 states have call predecessors, (126), 3 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-16 17:51:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 958 transitions. [2025-03-16 17:51:33,036 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 958 transitions. Word has length 83 [2025-03-16 17:51:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:33,039 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 958 transitions. [2025-03-16 17:51:33,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 17 states have internal predecessors, (80), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-16 17:51:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 958 transitions. [2025-03-16 17:51:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 17:51:33,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:33,044 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-16 17:51:33,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:51:33,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:51:33,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1037535101, now seen corresponding path program 2 times [2025-03-16 17:51:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446369830] [2025-03-16 17:51:33,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:51:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:33,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-16 17:51:33,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 17:51:33,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:51:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-16 17:51:33,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:33,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446369830] [2025-03-16 17:51:33,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446369830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:33,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:51:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759667089] [2025-03-16 17:51:33,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:33,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:51:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:33,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:51:33,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:51:33,363 INFO L87 Difference]: Start difference. First operand 599 states and 958 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:51:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:33,418 INFO L93 Difference]: Finished difference Result 601 states and 959 transitions. [2025-03-16 17:51:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:51:33,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2025-03-16 17:51:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:33,419 INFO L225 Difference]: With dead ends: 601 [2025-03-16 17:51:33,419 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:51:33,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:51:33,421 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:33,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:51:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:51:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:51:33,424 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-16 17:51:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:51:33,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-03-16 17:51:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:33,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:51:33,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:51:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:51:33,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:51:33,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:51:33,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:51:33,431 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-16 17:51:33,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:51:34,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:51:34,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:51:34 BoogieIcfgContainer [2025-03-16 17:51:34,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:51:34,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:51:34,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:51:34,160 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:51:34,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:30" (3/4) ... [2025-03-16 17:51:34,162 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:51:34,166 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-16 17:51:34,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 17:51:34,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 17:51:34,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:51:34,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:51:34,231 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:51:34,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:51:34,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:51:34,233 INFO L158 Benchmark]: Toolchain (without parser) took 4047.88ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 47.2MB in the end (delta: 75.0MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2025-03-16 17:51:34,233 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:34,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.10ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 111.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:34,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.32ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:34,233 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.8MB in the end (delta: 896.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:34,234 INFO L158 Benchmark]: IcfgBuilder took 183.98ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.9MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:51:34,234 INFO L158 Benchmark]: TraceAbstraction took 3589.37ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 53.6MB in the end (delta: 43.4MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2025-03-16 17:51:34,234 INFO L158 Benchmark]: Witness Printer took 71.58ms. Allocated memory is still 167.8MB. Free memory was 53.6MB in the beginning and 47.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:34,235 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 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.10ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 111.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.32ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.8MB in the end (delta: 896.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 183.98ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.9MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3589.37ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 53.6MB in the end (delta: 43.4MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 71.58ms. Allocated memory is still 167.8MB. Free memory was 53.6MB in the beginning and 47.2MB in the end (delta: 6.4MB). 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: 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, 23 locations, 37 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 868 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 643 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 225 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=7, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 591 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1158/1348 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: 18]: Location Invariant Derived location invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-03-16 17:51:34,248 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