./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound5.c -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 7f61497696f0e412e267c342267f07f29bf3ce290f707b3aa1a4f0ac00ff0274 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:43:52,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:43:52,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:43:52,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:43:52,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:43:52,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:43:52,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:43:52,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:43:52,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:43:52,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:43:52,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:43:52,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:43:52,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:43:52,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:43:52,445 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:43:52,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:43:52,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:43:52,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:43:52,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:43:52,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:43:52,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:43:52,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:43:52,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:43:52,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:43:52,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:43:52,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:43:52,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:43:52,448 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 -> 7f61497696f0e412e267c342267f07f29bf3ce290f707b3aa1a4f0ac00ff0274 [2025-03-03 13:43:52,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:43:52,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:43:52,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:43:52,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:43:52,672 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:43:52,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound5.c [2025-03-03 13:43:53,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a284a920/d05dacaa23094299bbc6f58187d2fcf6/FLAG60616eb63 [2025-03-03 13:43:53,999 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:43:54,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound5.c [2025-03-03 13:43:54,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a284a920/d05dacaa23094299bbc6f58187d2fcf6/FLAG60616eb63 [2025-03-03 13:43:54,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a284a920/d05dacaa23094299bbc6f58187d2fcf6 [2025-03-03 13:43:54,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:43:54,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:43:54,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:43:54,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:43:54,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:43:54,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f52764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54, skipping insertion in model container [2025-03-03 13:43:54,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:43:54,476 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/nla-digbench-scaling/bresenham-ll_unwindbound5.c[597,610] [2025-03-03 13:43:54,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:43:54,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:43:54,503 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/nla-digbench-scaling/bresenham-ll_unwindbound5.c[597,610] [2025-03-03 13:43:54,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:43:54,521 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:43:54,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54 WrapperNode [2025-03-03 13:43:54,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:43:54,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:43:54,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:43:54,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:43:54,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,543 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-03 13:43:54,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:43:54,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:43:54,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:43:54,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:43:54,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,558 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:43:54,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:43:54,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:43:54,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:43:54,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:43:54,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (1/1) ... [2025-03-03 13:43:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:43:54,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:54,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:43:54,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:43:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:43:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:43:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:43:54,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:43:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:43:54,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:43:54,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:43:54,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:43:54,732 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 13:43:54,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:43:54,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:43:54,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:43:54,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:43:54 BoogieIcfgContainer [2025-03-03 13:43:54,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:43:54,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:43:54,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:43:54,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:43:54,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:43:54" (1/3) ... [2025-03-03 13:43:54,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64128034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:43:54, skipping insertion in model container [2025-03-03 13:43:54,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:54" (2/3) ... [2025-03-03 13:43:54,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64128034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:43:54, skipping insertion in model container [2025-03-03 13:43:54,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:43:54" (3/3) ... [2025-03-03 13:43:54,746 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound5.c [2025-03-03 13:43:54,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:43:54,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound5.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:43:54,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:43:54,805 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;@5bb24d09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:43:54,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:43:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:43:54,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:54,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:54,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:54,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2131387279, now seen corresponding path program 1 times [2025-03-03 13:43:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:54,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118888669] [2025-03-03 13:43:54,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:54,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:54,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:54,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118888669] [2025-03-03 13:43:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118888669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:54,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:43:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818942409] [2025-03-03 13:43:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:54,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:43:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:54,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:43:54,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:43:54,933 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:54,942 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-03-03 13:43:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:43:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:43:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:54,946 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:43:54,946 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 13:43:54,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:43:54,949 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:54,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 13:43:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 13:43:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:43:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-03 13:43:54,967 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2025-03-03 13:43:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-03 13:43:54,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-03 13:43:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:43:54,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:54,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:54,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:43:54,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2144245658, now seen corresponding path program 1 times [2025-03-03 13:43:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619463689] [2025-03-03 13:43:54,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:54,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:54,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:54,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:54,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637410463] [2025-03-03 13:43:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:54,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:43:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:43:55,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:55,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:55,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:55,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:55,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:43:55,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:55,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:43:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619463689] [2025-03-03 13:43:55,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637410463] [2025-03-03 13:43:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637410463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:55,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:43:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850349015] [2025-03-03 13:43:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:55,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:43:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:55,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:43:55,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:43:55,174 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:55,256 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-03 13:43:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:43:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:43:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:55,258 INFO L225 Difference]: With dead ends: 30 [2025-03-03 13:43:55,258 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:43:55,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:43:55,259 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:55,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:43:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-03-03 13:43:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 13:43:55,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2025-03-03 13:43:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:55,266 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 13:43:55,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 13:43:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:43:55,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:55,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:55,274 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-03 13:43:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:55,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1996373859, now seen corresponding path program 1 times [2025-03-03 13:43:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080599669] [2025-03-03 13:43:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:43:55,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:43:55,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:55,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:55,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080599669] [2025-03-03 13:43:55,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080599669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:55,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:55,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:43:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668933389] [2025-03-03 13:43:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:55,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:43:55,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:55,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:43:55,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:43:55,552 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:55,565 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-03 13:43:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:43:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-03-03 13:43:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:55,567 INFO L225 Difference]: With dead ends: 31 [2025-03-03 13:43:55,567 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:43:55,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:43:55,568 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:55,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:43:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 13:43:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-03 13:43:55,571 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2025-03-03 13:43:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-03 13:43:55,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:43:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-03 13:43:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:43:55,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:55,572 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:55,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:43:55,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:55,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1260892537, now seen corresponding path program 1 times [2025-03-03 13:43:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550119190] [2025-03-03 13:43:55,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:55,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:43:55,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:43:55,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:55,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967108240] [2025-03-03 13:43:55,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:55,599 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-03 13:43:55,600 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-03 13:43:55,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:43:55,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:43:55,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:55,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:55,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:43:55,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:55,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:43:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550119190] [2025-03-03 13:43:55,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967108240] [2025-03-03 13:43:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967108240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:55,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:43:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31770152] [2025-03-03 13:43:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:55,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:43:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:55,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:43:55,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:43:55,720 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:43:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:55,776 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-03 13:43:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:43:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 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 15 [2025-03-03 13:43:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:55,777 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:43:55,777 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 13:43:55,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:43:55,777 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:55,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 13:43:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-03 13:43:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-03 13:43:55,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2025-03-03 13:43:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:55,788 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-03 13:43:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:43:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-03 13:43:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:43:55,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:55,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:55,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:43:55,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 13:43:55,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:55,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash -578761182, now seen corresponding path program 1 times [2025-03-03 13:43:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740640069] [2025-03-03 13:43:55,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:55,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:43:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:43:56,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:56,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319452372] [2025-03-03 13:43:56,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:56,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:56,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:56,018 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-03 13:43:56,020 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-03 13:43:56,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:43:56,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:43:56,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:56,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:56,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 13:43:56,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:56,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:43:56,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740640069] [2025-03-03 13:43:56,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319452372] [2025-03-03 13:43:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319452372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:56,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:56,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-03-03 13:43:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806326076] [2025-03-03 13:43:56,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:56,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:43:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:56,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:43:56,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:43:56,256 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:56,397 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-03-03 13:43:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:43:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-03 13:43:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:56,398 INFO L225 Difference]: With dead ends: 41 [2025-03-03 13:43:56,398 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 13:43:56,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:43:56,399 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:56,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:43:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 13:43:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2025-03-03 13:43:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-03 13:43:56,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2025-03-03 13:43:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:56,407 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-03 13:43:56,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:43:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-03 13:43:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:43:56,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:56,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:56,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:43:56,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:56,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:56,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -812459557, now seen corresponding path program 1 times [2025-03-03 13:43:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723382730] [2025-03-03 13:43:56,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:56,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:43:56,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:43:56,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:56,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723382730] [2025-03-03 13:43:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723382730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:43:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860034872] [2025-03-03 13:43:56,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:56,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:43:56,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:43:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:43:56,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:43:56,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:56,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:56,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:43:56,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:56,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860034872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:56,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:43:56,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-03 13:43:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199214337] [2025-03-03 13:43:56,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:56,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:43:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:56,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:43:56,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:43:56,781 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:43:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:56,828 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-03-03 13:43:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:43:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-03 13:43:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:56,829 INFO L225 Difference]: With dead ends: 68 [2025-03-03 13:43:56,829 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 13:43:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:43:56,829 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:56,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 13:43:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-03-03 13:43:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:43:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-03 13:43:56,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2025-03-03 13:43:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:56,841 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-03 13:43:56,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:43:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-03 13:43:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:43:56,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:56,843 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:56,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:43:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:57,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 810324465, now seen corresponding path program 1 times [2025-03-03 13:43:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131599555] [2025-03-03 13:43:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:57,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:57,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:57,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:57,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748546623] [2025-03-03 13:43:57,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:57,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:57,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:43:57,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:43:57,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:57,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:57,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:57,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:57,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:43:57,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:43:57,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:43:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131599555] [2025-03-03 13:43:57,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748546623] [2025-03-03 13:43:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748546623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:57,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-03-03 13:43:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990790000] [2025-03-03 13:43:57,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:43:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:57,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:43:57,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:43:57,360 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:43:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:57,473 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-03-03 13:43:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:43:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-03-03 13:43:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:57,474 INFO L225 Difference]: With dead ends: 79 [2025-03-03 13:43:57,474 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 13:43:57,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:43:57,475 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:57,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:43:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 13:43:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-03 13:43:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:43:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-03-03 13:43:57,487 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2025-03-03 13:43:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-03-03 13:43:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:43:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-03-03 13:43:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:43:57,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:57,488 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:57,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:43:57,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:57,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:57,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1977091022, now seen corresponding path program 1 times [2025-03-03 13:43:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222351961] [2025-03-03 13:43:57,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:57,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:57,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:57,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959227558] [2025-03-03 13:43:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:57,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:57,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:43:57,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:43:57,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:57,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:57,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:57,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:57,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 13:43:57,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:43:57,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:43:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222351961] [2025-03-03 13:43:58,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:58,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959227558] [2025-03-03 13:43:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959227558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:58,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-03-03 13:43:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407756482] [2025-03-03 13:43:58,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:43:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:58,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:43:58,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:43:58,317 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:43:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:58,884 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2025-03-03 13:43:58,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:43:58,885 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2025-03-03 13:43:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:58,886 INFO L225 Difference]: With dead ends: 89 [2025-03-03 13:43:58,886 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 13:43:58,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-03-03 13:43:58,888 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:58,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:43:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 13:43:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-03-03 13:43:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:43:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-03 13:43:58,905 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 25 [2025-03-03 13:43:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:58,906 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-03 13:43:58,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:43:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-03 13:43:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:43:58,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:58,909 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:58,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:43:59,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:59,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash 233143778, now seen corresponding path program 1 times [2025-03-03 13:43:59,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:59,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474513462] [2025-03-03 13:43:59,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:59,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:43:59,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:43:59,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:59,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:43:59,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474513462] [2025-03-03 13:43:59,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474513462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:43:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348835470] [2025-03-03 13:43:59,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:59,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:59,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:59,344 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:43:59,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:43:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:43:59,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:43:59,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:59,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:59,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:43:59,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:43:59,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:43:59,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348835470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:59,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:43:59,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-03 13:43:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668842152] [2025-03-03 13:43:59,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:59,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:43:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:59,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:43:59,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:43:59,823 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:43:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:59,965 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-03-03 13:43:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:43:59,965 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2025-03-03 13:43:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:59,966 INFO L225 Difference]: With dead ends: 105 [2025-03-03 13:43:59,966 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 13:43:59,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:43:59,967 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:59,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:43:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 13:43:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-03-03 13:43:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:43:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-03-03 13:43:59,983 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2025-03-03 13:43:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-03-03 13:43:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:43:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-03-03 13:43:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:43:59,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:59,984 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:59,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:00,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:00,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:00,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash -259133278, now seen corresponding path program 2 times [2025-03-03 13:44:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:00,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888065085] [2025-03-03 13:44:00,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:00,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 13:44:00,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:44:00,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:00,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888065085] [2025-03-03 13:44:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888065085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319582771] [2025-03-03 13:44:00,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:00,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:00,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:44:00,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-03 13:44:00,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:44:00,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:00,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:00,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:44:00,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:44:00,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319582771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:00,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 13:44:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587514263] [2025-03-03 13:44:00,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:44:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:00,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:44:00,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:44:00,365 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 13:44:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:00,429 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-03-03 13:44:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:44:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-03-03 13:44:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:00,430 INFO L225 Difference]: With dead ends: 120 [2025-03-03 13:44:00,430 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 13:44:00,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:44:00,431 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:00,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 13:44:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-03 13:44:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:44:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-03-03 13:44:00,443 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 45 [2025-03-03 13:44:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:00,443 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-03-03 13:44:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 13:44:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-03-03 13:44:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:44:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:00,444 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:00,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:44:00,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:00,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1958624675, now seen corresponding path program 3 times [2025-03-03 13:44:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574925521] [2025-03-03 13:44:00,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:00,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-03 13:44:00,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:44:00,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:44:00,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574925521] [2025-03-03 13:44:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574925521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:00,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878107607] [2025-03-03 13:44:00,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:00,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:00,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:00,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:44:00,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-03-03 13:44:00,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 45 statements. [2025-03-03 13:44:00,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:44:00,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:00,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:44:00,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:01,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:44:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878107607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:01,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 29 [2025-03-03 13:44:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658798336] [2025-03-03 13:44:01,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:44:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:01,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:44:01,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:44:01,569 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 13:44:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:03,036 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2025-03-03 13:44:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 13:44:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2025-03-03 13:44:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:03,037 INFO L225 Difference]: With dead ends: 111 [2025-03-03 13:44:03,037 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 13:44:03,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:44:03,038 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:03,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 326 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 13:44:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 13:44:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2025-03-03 13:44:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:44:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-03-03 13:44:03,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45 [2025-03-03 13:44:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:03,053 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-03-03 13:44:03,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 13:44:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-03-03 13:44:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 13:44:03,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:03,054 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:03,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 13:44:03,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:03,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:03,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash 50488643, now seen corresponding path program 2 times [2025-03-03 13:44:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868341898] [2025-03-03 13:44:03,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:03,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 13:44:03,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:44:03,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:03,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868341898] [2025-03-03 13:44:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868341898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546629089] [2025-03-03 13:44:03,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:03,387 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:03,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:44:03,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 13:44:03,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:44:03,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:03,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:44:03,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:44:03,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:44:03,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546629089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:03,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:03,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 11 [2025-03-03 13:44:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155248386] [2025-03-03 13:44:03,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:03,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:44:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:03,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:44:03,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:44:03,543 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 13:44:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:03,598 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2025-03-03 13:44:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:44:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2025-03-03 13:44:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:03,599 INFO L225 Difference]: With dead ends: 90 [2025-03-03 13:44:03,599 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 13:44:03,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:44:03,599 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:03,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 13:44:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-03 13:44:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:44:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2025-03-03 13:44:03,609 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 49 [2025-03-03 13:44:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:03,609 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2025-03-03 13:44:03,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 13:44:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2025-03-03 13:44:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 13:44:03,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:03,612 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:03,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:44:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:44:03,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2089363387, now seen corresponding path program 3 times [2025-03-03 13:44:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518498379] [2025-03-03 13:44:03,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:03,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 6 equivalence classes. [2025-03-03 13:44:03,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 13:44:03,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:44:03,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347938902] [2025-03-03 13:44:03,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:03,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:03,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:03,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:44:03,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 6 equivalence classes. [2025-03-03 13:44:03,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 59 statements. [2025-03-03 13:44:03,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:44:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:03,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:44:03,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:44:03,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:44:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518498379] [2025-03-03 13:44:04,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347938902] [2025-03-03 13:44:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347938902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:04,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:04,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2025-03-03 13:44:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749856882] [2025-03-03 13:44:04,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:04,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:44:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:04,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:44:04,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:44:04,122 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:44:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:04,230 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2025-03-03 13:44:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:44:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-03-03 13:44:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:04,231 INFO L225 Difference]: With dead ends: 127 [2025-03-03 13:44:04,231 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 13:44:04,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:44:04,232 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:04,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 13:44:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2025-03-03 13:44:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 95 states have internal predecessors, (106), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 13:44:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2025-03-03 13:44:04,251 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 59 [2025-03-03 13:44:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2025-03-03 13:44:04,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 13:44:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2025-03-03 13:44:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 13:44:04,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:04,252 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:04,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:04,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:44:04,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash 281908924, now seen corresponding path program 1 times [2025-03-03 13:44:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:04,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029307582] [2025-03-03 13:44:04,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:04,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 13:44:04,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 13:44:04,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713726995] [2025-03-03 13:44:04,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:04,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:04,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:04,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:04,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:44:04,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 13:44:04,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 13:44:04,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:44:04,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:44:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 13:44:04,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 13:44:04,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:04,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:44:04,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:44:04,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:44:04,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:44:04,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 13:44:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 13:44:04,747 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:04,776 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:44:04,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:44:04 BoogieIcfgContainer [2025-03-03 13:44:04,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:44:04,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:44:04,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:44:04,778 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:44:04,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:43:54" (3/4) ... [2025-03-03 13:44:04,779 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:44:04,821 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 40. [2025-03-03 13:44:04,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:44:04,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:44:04,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:44:04,873 INFO L158 Benchmark]: Toolchain (without parser) took 10515.07ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 92.0MB in the end (delta: 42.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-03 13:44:04,874 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:04,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.62ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:04,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:04,875 INFO L158 Benchmark]: Boogie Preprocessor took 24.02ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:04,875 INFO L158 Benchmark]: IcfgBuilder took 170.29ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 109.3MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:44:04,875 INFO L158 Benchmark]: TraceAbstraction took 10037.53ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 100.0MB in the end (delta: 8.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-03 13:44:04,875 INFO L158 Benchmark]: Witness Printer took 94.99ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 92.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:04,876 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.62ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.02ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 170.29ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 109.3MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10037.53ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 100.0MB in the end (delta: 8.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 94.99ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 92.0MB in the end (delta: 8.0MB). 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=10, Y=1, counter=0, v=-8, x=0, y=0] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=1, v=-8, x=0, y=0] [L31] COND TRUE counter++<5 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=10, Y=1, counter=1, v=-8, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=10, Y=1, counter=1, v=-8, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=10, Y=1, counter=1, v=-8, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=10, Y=1, counter=1, v=-6, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=10, Y=1, counter=1, v=-6, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=2, v=-6, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<5 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=10, Y=1, counter=2, v=-6, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=10, Y=1, counter=2, v=-6, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=10, Y=1, counter=2, v=-6, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=10, Y=1, counter=2, v=-4, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=10, Y=1, counter=2, v=-4, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=3, v=-4, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<5 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=10, Y=1, counter=3, v=-4, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=10, Y=1, counter=3, v=-4, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=10, Y=1, counter=3, v=-4, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=10, Y=1, counter=3, v=-2, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=10, Y=1, counter=3, v=-2, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=4, v=-2, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<5 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=10, Y=1, counter=4, v=-2, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=10, Y=1, counter=4, v=-2, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=10, Y=1, counter=4, v=-2, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=10, Y=1, counter=4, v=0, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=10, Y=1, counter=4, v=0, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=5, v=0, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<5 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=10, Y=1, counter=5, v=0, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=10, Y=1, counter=5, v=0, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=10, Y=1, counter=5, v=0, x=4, xy=0, y=0, yx=4] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=10, Y=1, counter=5, v=-18, x=4, xy=0, y=1, yx=4] [L45] x++ VAL [X=10, Y=1, counter=5, v=-18, x=5, xy=0, y=1, yx=4] [L31] COND TRUE counter++<5 [L31] EXPR counter++ VAL [X=10, Y=1, counter=6, v=-18, x=5, xy=0, y=1, yx=4] [L31] COND FALSE !(counter++<5) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=10, Y=1, counter=6, v=-18, xy=5, y=1, yx=5] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=6] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L16] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1267 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1070 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 197 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 559 SyntacticMatches, 19 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=13, InterpolantAutomatonStates: 148, 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, 13 MinimizatonAttempts, 79 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 841 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 876 ConstructedInterpolants, 6 QuantifiedInterpolants, 4248 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 27 InterpolantComputations, 4 PerfectInterpolantSequences, 723/1098 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-03 13:44:04,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE