./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.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 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:25:44,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:25:44,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:25:44,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:25:44,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:25:44,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:25:44,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:25:44,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:25:44,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:25:44,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:25:44,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:25:44,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:25:44,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:25:44,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:25:44,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:25:44,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:25:44,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:25:44,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:25:44,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:25:44,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:25:44,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:25:44,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:25:44,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:25:44,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:25:44,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:25:44,272 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 -> 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa [2025-03-16 18:25:44,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:25:44,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:25:44,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:25:44,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:25:44,498 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:25:44,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2025-03-16 18:25:45,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bccca81f/b6c7e7141f6a44138c65c99f77fce123/FLAG8d64f1393 [2025-03-16 18:25:45,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:25:45,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2025-03-16 18:25:45,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bccca81f/b6c7e7141f6a44138c65c99f77fce123/FLAG8d64f1393 [2025-03-16 18:25:46,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bccca81f/b6c7e7141f6a44138c65c99f77fce123 [2025-03-16 18:25:46,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:25:46,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:25:46,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:25:46,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:25:46,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:25:46,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46, skipping insertion in model container [2025-03-16 18:25:46,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:25:46,233 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/mannadiv_unwindbound20.c[573,586] [2025-03-16 18:25:46,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:25:46,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:25:46,256 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/mannadiv_unwindbound20.c[573,586] [2025-03-16 18:25:46,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:25:46,268 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:25:46,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46 WrapperNode [2025-03-16 18:25:46,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:25:46,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:25:46,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:25:46,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:25:46,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,289 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-16 18:25:46,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:25:46,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:25:46,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:25:46,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:25:46,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 18:25:46,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:25:46,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:25:46,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:25:46,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:25:46,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (1/1) ... [2025-03-16 18:25:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:25:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:46,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:25:46,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:25:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:25:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 18:25:46,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 18:25:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:25:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:25:46,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:25:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:25:46,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:25:46,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:25:46,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:25:46,480 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 18:25:46,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:25:46,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:25:46,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:25:46,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:25:46 BoogieIcfgContainer [2025-03-16 18:25:46,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:25:46,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:25:46,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:25:46,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:25:46,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:25:46" (1/3) ... [2025-03-16 18:25:46,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc1d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:25:46, skipping insertion in model container [2025-03-16 18:25:46,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:25:46" (2/3) ... [2025-03-16 18:25:46,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc1d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:25:46, skipping insertion in model container [2025-03-16 18:25:46,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:25:46" (3/3) ... [2025-03-16 18:25:46,494 INFO L128 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2025-03-16 18:25:46,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:25:46,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mannadiv_unwindbound20.c that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:25:46,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:25:46,550 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;@6a231892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:25:46,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:25:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:25:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 18:25:46,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:46,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:46,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:46,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1774886395, now seen corresponding path program 1 times [2025-03-16 18:25:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281210550] [2025-03-16 18:25:46,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:46,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:25:46,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:25:46,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:46,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:25:46,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:46,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281210550] [2025-03-16 18:25:46,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281210550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:46,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619037735] [2025-03-16 18:25:46,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:46,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:46,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:46,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:25:46,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:25:46,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 18:25:46,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 18:25:46,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:46,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 18:25:46,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:25:46,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:25:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619037735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:25:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:25:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 18:25:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054854283] [2025-03-16 18:25:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:25:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:25:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:46,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:25:46,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:25:46,739 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:25:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:46,750 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2025-03-16 18:25:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:25:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-16 18:25:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:46,756 INFO L225 Difference]: With dead ends: 44 [2025-03-16 18:25:46,756 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:25:46,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-16 18:25:46,760 INFO L435 NwaCegarLoop]: 27 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, 27 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-16 18:25:46,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:25:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:25:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 18:25:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:25:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 18:25:46,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2025-03-16 18:25:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:46,783 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 18:25:46,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:25:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 18:25:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 18:25:46,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:46,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:46,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:25:46,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 18:25:46,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:46,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2078079995, now seen corresponding path program 1 times [2025-03-16 18:25:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257201011] [2025-03-16 18:25:46,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:46,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:25:47,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:25:47,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:47,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:25:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188464702] [2025-03-16 18:25:47,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:47,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:25:47,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:25:47,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:25:47,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:25:47,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:47,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:47,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:25:47,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:47,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:25:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257201011] [2025-03-16 18:25:47,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:25:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188464702] [2025-03-16 18:25:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188464702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:25:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:25:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:25:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376251944] [2025-03-16 18:25:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:25:47,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:25:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:47,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:25:47,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:25:47,143 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:25:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:47,189 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-16 18:25:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:25:47,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-16 18:25:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:47,190 INFO L225 Difference]: With dead ends: 32 [2025-03-16 18:25:47,190 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:25:47,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:25:47,191 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:25:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:25:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-16 18:25:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:25:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-16 18:25:47,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2025-03-16 18:25:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:47,199 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-16 18:25:47,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:25:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-16 18:25:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 18:25:47,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:47,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:47,205 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-16 18:25:47,402 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,SelfDestructingSolverStorable1 [2025-03-16 18:25:47,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:47,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2078943934, now seen corresponding path program 1 times [2025-03-16 18:25:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568348961] [2025-03-16 18:25:47,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 18:25:47,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 18:25:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:47,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568348961] [2025-03-16 18:25:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568348961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:25:47,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:25:47,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:25:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877676747] [2025-03-16 18:25:47,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:25:47,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:25:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:47,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:25:47,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:25:47,473 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:25:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:47,484 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-16 18:25:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:25:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-16 18:25:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:47,485 INFO L225 Difference]: With dead ends: 34 [2025-03-16 18:25:47,485 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:25:47,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 18:25:47,486 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 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-16 18:25:47,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:25:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:25:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:25:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:25:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-16 18:25:47,491 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2025-03-16 18:25:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:47,491 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-16 18:25:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 18:25:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-16 18:25:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 18:25:47,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:47,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:25:47,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:47,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 770442274, now seen corresponding path program 1 times [2025-03-16 18:25:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866719744] [2025-03-16 18:25:47,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:47,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:25:47,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:25:47,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:47,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866719744] [2025-03-16 18:25:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866719744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:47,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472556550] [2025-03-16 18:25:47,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:47,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:47,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:47,717 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:25:47,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:25:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:25:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:25:47,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:47,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:25:47,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:47,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:25:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472556550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:25:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:25:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 18:25:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619512261] [2025-03-16 18:25:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:25:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:25:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:47,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:25:47,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:25:47,842 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:25:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:47,879 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-16 18:25:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:25:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-03-16 18:25:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:47,879 INFO L225 Difference]: With dead ends: 36 [2025-03-16 18:25:47,880 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 18:25:47,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:25:47,880 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:47,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:25:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 18:25:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-16 18:25:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:25:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-16 18:25:47,884 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2025-03-16 18:25:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:47,884 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-16 18:25:47,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:25:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-16 18:25:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:25:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:47,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:47,891 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-16 18:25:48,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:48,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1415055605, now seen corresponding path program 1 times [2025-03-16 18:25:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638748323] [2025-03-16 18:25:48,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:48,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:25:48,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:25:48,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:48,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:25:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297459240] [2025-03-16 18:25:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:48,111 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-16 18:25:48,113 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-16 18:25:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:25:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:25:48,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:48,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 18:25:48,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:48,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:25:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638748323] [2025-03-16 18:25:48,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:25:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297459240] [2025-03-16 18:25:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297459240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:25:48,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:25:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-16 18:25:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197221064] [2025-03-16 18:25:48,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:25:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:25:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:48,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:25:48,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:25:48,286 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 18:25:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:48,365 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2025-03-16 18:25:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:25:48,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2025-03-16 18:25:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:48,366 INFO L225 Difference]: With dead ends: 58 [2025-03-16 18:25:48,366 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 18:25:48,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:25:48,367 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:48,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:25:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 18:25:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-03-16 18:25:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 18:25:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-16 18:25:48,375 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 27 [2025-03-16 18:25:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:48,376 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-16 18:25:48,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 18:25:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-16 18:25:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:25:48,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:48,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:48,382 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-16 18:25:48,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:48,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1415919544, now seen corresponding path program 1 times [2025-03-16 18:25:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-03-16 18:25:48,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:48,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:25:48,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:25:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:48,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-03-16 18:25:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972584427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535844705] [2025-03-16 18:25:48,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:48,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:48,655 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-16 18:25:48,656 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-16 18:25:48,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:25:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:25:48,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:48,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:25:48,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:48,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:25:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535844705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:25:48,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:25:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-16 18:25:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983229608] [2025-03-16 18:25:48,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:25:48,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:25:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:48,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:25:48,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:25:48,765 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 18:25:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:48,835 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-03-16 18:25:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:25:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2025-03-16 18:25:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:48,837 INFO L225 Difference]: With dead ends: 71 [2025-03-16 18:25:48,837 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 18:25:48,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 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-16 18:25:48,837 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:48,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:25:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 18:25:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2025-03-16 18:25:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 18:25:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-16 18:25:48,848 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 27 [2025-03-16 18:25:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:48,849 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-16 18:25:48,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 18:25:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-16 18:25:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 18:25:48,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:48,850 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:48,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:25:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:49,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:49,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -238817892, now seen corresponding path program 1 times [2025-03-16 18:25:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-16 18:25:49,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:49,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 18:25:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 18:25:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:25:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:49,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-16 18:25:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812860082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:49,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880988434] [2025-03-16 18:25:49,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:25:49,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:49,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:49,204 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-16 18:25:49,206 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-16 18:25:49,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 18:25:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 18:25:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:49,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 18:25:49,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:25:49,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:25:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:25:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880988434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:25:49,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:25:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2025-03-16 18:25:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427413117] [2025-03-16 18:25:49,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:25:49,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:25:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:49,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:25:49,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:25:49,435 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:25:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:49,529 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2025-03-16 18:25:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:25:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 33 [2025-03-16 18:25:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:49,531 INFO L225 Difference]: With dead ends: 62 [2025-03-16 18:25:49,532 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 18:25:49,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:25:49,533 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 191 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-16 18:25:49,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 191 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:25:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 18:25:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-16 18:25:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 18:25:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-03-16 18:25:49,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 33 [2025-03-16 18:25:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:49,544 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-03-16 18:25:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:25:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-03-16 18:25:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 18:25:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:49,547 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:49,553 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-16 18:25:49,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:49,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 656559422, now seen corresponding path program 2 times [2025-03-16 18:25:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923190067] [2025-03-16 18:25:49,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:25:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:49,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 18:25:49,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 18:25:49,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:25:49,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:25:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923190067] [2025-03-16 18:25:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923190067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721595202] [2025-03-16 18:25:49,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:25:49,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:49,906 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-16 18:25:49,908 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-16 18:25:49,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 18:25:49,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 18:25:49,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:25:49,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:25:49,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:50,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:25:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:25:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721595202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:25:50,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:25:50,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-03-16 18:25:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367001123] [2025-03-16 18:25:50,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:25:50,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 18:25:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:50,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 18:25:50,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:25:50,130 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-16 18:25:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:50,280 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2025-03-16 18:25:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 18:25:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2025-03-16 18:25:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:50,282 INFO L225 Difference]: With dead ends: 115 [2025-03-16 18:25:50,282 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 18:25:50,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:25:50,283 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:50,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 129 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:25:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 18:25:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-16 18:25:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.130952380952381) internal successors, (95), 84 states have internal predecessors, (95), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-16 18:25:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2025-03-16 18:25:50,293 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 54 [2025-03-16 18:25:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:50,293 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2025-03-16 18:25:50,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-16 18:25:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2025-03-16 18:25:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:25:50,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:50,295 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:50,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 18:25:50,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:50,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1989547778, now seen corresponding path program 3 times [2025-03-16 18:25:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:50,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-16 18:25:50,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:25:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:50,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-03-16 18:25:50,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:25:50,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-16 18:25:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 18:25:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:25:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-16 18:25:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072519813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:25:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254962303] [2025-03-16 18:25:51,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:25:51,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:51,134 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-16 18:25:51,135 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-16 18:25:51,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-03-16 18:25:51,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:25:51,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-16 18:25:51,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:25:51,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 18:25:51,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:25:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:25:51,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:25:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 18:25:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254962303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:25:51,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:25:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 42 [2025-03-16 18:25:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680439108] [2025-03-16 18:25:51,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:25:51,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 18:25:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:25:51,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 18:25:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1262, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 18:25:51,806 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2025-03-16 18:25:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:25:52,364 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2025-03-16 18:25:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 18:25:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) Word has length 108 [2025-03-16 18:25:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:25:52,366 INFO L225 Difference]: With dead ends: 205 [2025-03-16 18:25:52,367 INFO L226 Difference]: Without dead ends: 200 [2025-03-16 18:25:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 193 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1123, Invalid=2537, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 18:25:52,369 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 203 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:25:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 346 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:25:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-16 18:25:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-16 18:25:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 154 states have (on average 1.1363636363636365) internal successors, (175), 154 states have internal predecessors, (175), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 18:25:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2025-03-16 18:25:52,395 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 108 [2025-03-16 18:25:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:25:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2025-03-16 18:25:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2025-03-16 18:25:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2025-03-16 18:25:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 18:25:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:25:52,396 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:52,407 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-16 18:25:52,601 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,SelfDestructingSolverStorable8 [2025-03-16 18:25:52,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:25:52,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:25:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1246385982, now seen corresponding path program 4 times [2025-03-16 18:25:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:25:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671508405] [2025-03-16 18:25:52,602 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:25:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:25:52,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 198 statements into 2 equivalence classes. [2025-03-16 18:25:52,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 18:25:52,656 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:25:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:25:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983810575] [2025-03-16 18:25:52,658 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:25:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:25:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:25:52,659 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-16 18:25:52,661 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-16 18:25:52,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 198 statements into 2 equivalence classes. [2025-03-16 18:25:52,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 18:25:52,763 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:25:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:25:52,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 18:25:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 18:25:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 18:25:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:25:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:25:52,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 18:25:52,846 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 18:25:52,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:25:52,855 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-16 18:25:53,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 18:25:53,051 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-03-16 18:25:53,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:25:53,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:25:53 BoogieIcfgContainer [2025-03-16 18:25:53,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:25:53,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:25:53,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:25:53,110 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:25:53,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:25:46" (3/4) ... [2025-03-16 18:25:53,111 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 18:25:53,182 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 151. [2025-03-16 18:25:53,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:25:53,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:25:53,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:25:53,285 INFO L158 Benchmark]: Toolchain (without parser) took 7169.52ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 114.4MB in the beginning and 115.9MB in the end (delta: -1.5MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.09ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 102.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.50ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: IcfgBuilder took 180.52ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 89.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:25:53,286 INFO L158 Benchmark]: TraceAbstraction took 6620.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.1MB in the beginning and 130.2MB in the end (delta: -41.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:25:53,287 INFO L158 Benchmark]: Witness Printer took 174.70ms. Allocated memory is still 176.2MB. Free memory was 130.2MB in the beginning and 115.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:25:53,288 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.09ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 102.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.50ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.52ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 89.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6620.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 89.1MB in the beginning and 130.2MB in the end (delta: -41.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 174.70ms. Allocated memory is still 176.2MB. Free memory was 130.2MB in the beginning and 115.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND TRUE counter++<20 [L36] EXPR counter++ VAL [counter=21, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 34 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 1091 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 903 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 188 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 505 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=9, InterpolantAutomatonStates: 109, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1030 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 2106 SizeOfPredicates, 20 NumberOfNonLiveVariables, 929 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 612/1687 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-16 18:25:53,305 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