./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-798a7b3-m [2025-03-03 14:07:07,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:07:07,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:07:07,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:07:07,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:07:08,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:07:08,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:07:08,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:07:08,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:07:08,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:07:08,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:07:08,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:07:08,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:07:08,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:07:08,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:07:08,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:07:08,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:07:08,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:07:08,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:07:08,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:07:08,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:07:08,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:07:08,023 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-03 14:07:08,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:07:08,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:07:08,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:07:08,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:07:08,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:07:08,243 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-03 14:07:09,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e473fcecf/3279b4d0000041d4b1caf915bead4a2a/FLAG4a6f2c2ba [2025-03-03 14:07:09,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:07:09,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2025-03-03 14:07:09,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e473fcecf/3279b4d0000041d4b1caf915bead4a2a/FLAG4a6f2c2ba [2025-03-03 14:07:09,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e473fcecf/3279b4d0000041d4b1caf915bead4a2a [2025-03-03 14:07:09,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:07:09,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:07:09,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:07:09,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:07:09,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:07:09,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:07:09" (1/1) ... [2025-03-03 14:07:09,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ed43b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:09, skipping insertion in model container [2025-03-03 14:07:09,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:07:09" (1/1) ... [2025-03-03 14:07:09,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:07:09,999 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-03 14:07:10,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:07:10,019 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:07:10,027 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-03 14:07:10,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:07:10,045 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:07:10,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10 WrapperNode [2025-03-03 14:07:10,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:07:10,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:07:10,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:07:10,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:07:10,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,065 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-03 14:07:10,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:07:10,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:07:10,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:07:10,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:07:10,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,084 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:07:10,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:07:10,092 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:07:10,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:07:10,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:07:10,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (1/1) ... [2025-03-03 14:07:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:07:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:10,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:07:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:07:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:07:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:07:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:07:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:07:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:07:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:07:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:07:10,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:07:10,178 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:07:10,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:07:10,268 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:07:10,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:07:10,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:07:10,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:07:10,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:10 BoogieIcfgContainer [2025-03-03 14:07:10,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:07:10,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:07:10,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:07:10,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:07:10,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:07:09" (1/3) ... [2025-03-03 14:07:10,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abc8ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:07:10, skipping insertion in model container [2025-03-03 14:07:10,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:10" (2/3) ... [2025-03-03 14:07:10,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abc8ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:07:10, skipping insertion in model container [2025-03-03 14:07:10,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:10" (3/3) ... [2025-03-03 14:07:10,286 INFO L128 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2025-03-03 14:07:10,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:07:10,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mannadiv_unwindbound20.c that has 3 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:07:10,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:07:10,342 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;@1cc400c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:07:10,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:07:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-03 14:07:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 14:07:10,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:10,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:10,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1157229416, now seen corresponding path program 1 times [2025-03-03 14:07:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:10,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295885706] [2025-03-03 14:07:10,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:10,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 14:07:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 14:07:10,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:10,441 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-03 14:07:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295885706] [2025-03-03 14:07:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295885706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355576801] [2025-03-03 14:07:10,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:10,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:10,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:10,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:10,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:07:10,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 14:07:10,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 14:07:10,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:10,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:10,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:07:10,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:10,501 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-03 14:07:10,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:07:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355576801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:07:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 14:07:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774644438] [2025-03-03 14:07:10,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:10,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:07:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:10,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:07:10,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:07:10,517 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03 14:07:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:10,526 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-03-03 14:07:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:07:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2025-03-03 14:07:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:10,531 INFO L225 Difference]: With dead ends: 47 [2025-03-03 14:07:10,531 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:07:10,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:07:10,534 INFO L435 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:10,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:07:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 14:07:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-03 14:07:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-03 14:07:10,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2025-03-03 14:07:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:10,553 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-03 14:07:10,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03 14:07:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-03 14:07:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:07:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:10,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:10,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:07:10,755 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-03 14:07:10,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -250313654, now seen corresponding path program 1 times [2025-03-03 14:07:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021849518] [2025-03-03 14:07:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:10,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:07:10,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:07:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:10,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574830212] [2025-03-03 14:07:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:10,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:10,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:10,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:07:10,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:07:10,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:07:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:10,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:07:10,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:10,937 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-03 14:07:10,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:07:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021849518] [2025-03-03 14:07:10,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574830212] [2025-03-03 14:07:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574830212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:07:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:07:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929157578] [2025-03-03 14:07:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:07:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:07:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:07:10,939 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:10,976 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-03 14:07:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:07:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 14:07:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:10,977 INFO L225 Difference]: With dead ends: 33 [2025-03-03 14:07:10,977 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 14:07:10,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:07:10,978 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 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-03 14:07:10,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 14:07:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-03 14:07:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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-03 14:07:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-03 14:07:10,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 19 [2025-03-03 14:07:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:10,986 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-03 14:07:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-03 14:07:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:07:10,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:10,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:10,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:07:11,187 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-03 14:07:11,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:11,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash -249449715, now seen corresponding path program 1 times [2025-03-03 14:07:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-03 14:07:11,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:11,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:07:11,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:07:11,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:11,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:11,287 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-03 14:07:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-03 14:07:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186079874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:11,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:07:11,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:07:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072930745] [2025-03-03 14:07:11,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:11,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:07:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:11,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:07:11,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:07:11,288 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:11,301 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-03-03 14:07:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:07:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 14:07:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:11,303 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:07:11,303 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 14:07:11,303 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-03 14:07:11,304 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:11,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 14:07:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 14:07:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 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-03 14:07:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-03 14:07:11,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2025-03-03 14:07:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:11,308 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-03 14:07:11,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-03 14:07:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:07:11,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:11,310 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, 1] [2025-03-03 14:07:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:07:11,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1168504528, now seen corresponding path program 1 times [2025-03-03 14:07:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:11,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331307077] [2025-03-03 14:07:11,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:07:11,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:07:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:11,585 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-03 14:07:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331307077] [2025-03-03 14:07:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331307077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420794200] [2025-03-03 14:07:11,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:11,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:11,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:11,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:11,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:07:11,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:07:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:07:11,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:11,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:07:11,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:11,728 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-03 14:07:11,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:07:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420794200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:11,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:07:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-03 14:07:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036643252] [2025-03-03 14:07:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:07:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:11,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:07:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:07:11,731 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03 14:07:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:11,775 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-03 14:07:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:07:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 25 [2025-03-03 14:07:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:11,777 INFO L225 Difference]: With dead ends: 37 [2025-03-03 14:07:11,777 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 14:07:11,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 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-03 14:07:11,778 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 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-03 14:07:11,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 14:07:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-03 14:07:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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-03 14:07:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-03 14:07:11,786 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2025-03-03 14:07:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:11,786 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-03 14:07:11,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03 14:07:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-03 14:07:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 14:07:11,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:11,786 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, 1] [2025-03-03 14:07:11,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:07:11,987 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-03 14:07:11,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 765906889, now seen corresponding path program 1 times [2025-03-03 14:07:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693617097] [2025-03-03 14:07:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:11,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 14:07:12,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:07:12,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:12,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645638959] [2025-03-03 14:07:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:12,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:12,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:12,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:07:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 14:07:12,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:07:12,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:12,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:12,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:07:12,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:12,165 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-03 14:07:12,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:12,241 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-03 14:07:12,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693617097] [2025-03-03 14:07:12,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645638959] [2025-03-03 14:07:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645638959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:12,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:07:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 14:07:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941343324] [2025-03-03 14:07:12,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:07:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:12,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:07:12,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:07:12,243 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-03 14:07:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:12,315 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-03 14:07:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:07:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 28 [2025-03-03 14:07:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:12,316 INFO L225 Difference]: With dead ends: 59 [2025-03-03 14:07:12,316 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:07:12,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 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-03 14:07:12,317 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:12,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:07:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-03 14:07:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-03 14:07:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-03 14:07:12,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 28 [2025-03-03 14:07:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:12,326 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-03 14:07:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-03 14:07:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-03 14:07:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 14:07:12,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:12,327 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, 1] [2025-03-03 14:07:12,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:12,532 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-03 14:07:12,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 766770828, now seen corresponding path program 1 times [2025-03-03 14:07:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841608134] [2025-03-03 14:07:12,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 14:07:12,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:07:12,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:12,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:12,607 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-03 14:07:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841608134] [2025-03-03 14:07:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841608134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898786005] [2025-03-03 14:07:12,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:12,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:07:12,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 14:07:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:07:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:12,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:07:12,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:12,684 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-03 14:07:12,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:12,723 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-03 14:07:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898786005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:12,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:07:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-03 14:07:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604534179] [2025-03-03 14:07:12,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:07:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:07:12,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:07:12,724 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-03 14:07:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:12,783 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-03-03 14:07:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:07:12,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 28 [2025-03-03 14:07:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:12,785 INFO L225 Difference]: With dead ends: 72 [2025-03-03 14:07:12,785 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 14:07:12,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:07:12,785 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 14:07:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-03 14:07:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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-03 14:07:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-03-03 14:07:12,792 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 28 [2025-03-03 14:07:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:12,792 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-03-03 14:07:12,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-03 14:07:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-03-03 14:07:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:07:12,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:12,793 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, 1] [2025-03-03 14:07:12,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:07:12,993 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-03 14:07:12,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -28612849, now seen corresponding path program 1 times [2025-03-03 14:07:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765926312] [2025-03-03 14:07:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:12,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:07:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:07:13,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:13,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:13,123 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-03 14:07:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765926312] [2025-03-03 14:07:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765926312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969266589] [2025-03-03 14:07:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:13,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:13,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:13,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:13,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:07:13,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:07:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:07:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:13,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:07:13,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:13,307 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-03 14:07:13,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:13,365 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-03 14:07:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969266589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:13,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:07:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2025-03-03 14:07:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117855264] [2025-03-03 14:07:13,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:13,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:07:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:13,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:07:13,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:07:13,366 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 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-03 14:07:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:13,471 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-03-03 14:07:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:07:13,471 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 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 34 [2025-03-03 14:07:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:13,473 INFO L225 Difference]: With dead ends: 66 [2025-03-03 14:07:13,473 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 14:07:13,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:07:13,474 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:13,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:07:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 14:07:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2025-03-03 14:07:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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-03 14:07:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-03 14:07:13,488 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 34 [2025-03-03 14:07:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:13,488 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-03 14:07:13,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 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-03 14:07:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-03-03 14:07:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:07:13,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:13,489 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, 1] [2025-03-03 14:07:13,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:13,689 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-03 14:07:13,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash -986007347, now seen corresponding path program 2 times [2025-03-03 14:07:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004754146] [2025-03-03 14:07:13,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:07:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:13,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 14:07:13,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:07:13,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:07:13,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:13,890 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-03 14:07:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004754146] [2025-03-03 14:07:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004754146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076674602] [2025-03-03 14:07:13,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:07:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:13,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:13,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:07:13,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 14:07:13,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:07:13,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:07:13,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:13,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:07:13,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:13,991 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-03 14:07:13,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:14,100 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-03 14:07:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076674602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:14,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:07:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-03-03 14:07:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169543092] [2025-03-03 14:07:14,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:14,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 14:07:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 14:07:14,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:07:14,104 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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-03 14:07:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:14,235 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2025-03-03 14:07:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 14:07:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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 55 [2025-03-03 14:07:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:14,236 INFO L225 Difference]: With dead ends: 116 [2025-03-03 14:07:14,236 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 14:07:14,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 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-03 14:07:14,237 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:14,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 120 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:07:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 14:07:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-03 14:07:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 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-03 14:07:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2025-03-03 14:07:14,253 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 55 [2025-03-03 14:07:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:14,253 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2025-03-03 14:07:14,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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-03 14:07:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2025-03-03 14:07:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:07:14,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:14,255 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, 1] [2025-03-03 14:07:14,261 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-03 14:07:14,456 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-03 14:07:14,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1774419309, now seen corresponding path program 3 times [2025-03-03 14:07:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130910185] [2025-03-03 14:07:14,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:07:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:14,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-03-03 14:07:14,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:07:14,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 14:07:14,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:15,026 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-03 14:07:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130910185] [2025-03-03 14:07:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130910185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069195134] [2025-03-03 14:07:15,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:07:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:15,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:15,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:07:15,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-03-03 14:07:15,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:07:15,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 14:07:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:15,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:07:15,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:15,222 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-03 14:07:15,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:15,553 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-03 14:07:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069195134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:15,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:07:15,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 14] total 33 [2025-03-03 14:07:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000805359] [2025-03-03 14:07:15,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:15,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:07:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:15,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:07:15,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=629, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:07:15,555 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 33 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2025-03-03 14:07:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:15,883 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2025-03-03 14:07:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 14:07:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) Word has length 109 [2025-03-03 14:07:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:15,900 INFO L225 Difference]: With dead ends: 206 [2025-03-03 14:07:15,900 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 14:07:15,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 14:07:15,902 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 117 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:15,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 232 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:07:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 14:07:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-03 14:07:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.135483870967742) internal successors, (176), 155 states have internal predecessors, (176), 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-03 14:07:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2025-03-03 14:07:15,925 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 109 [2025-03-03 14:07:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:15,925 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2025-03-03 14:07:15,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.454545454545454) internal successors, (147), 33 states have internal predecessors, (147), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2025-03-03 14:07:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2025-03-03 14:07:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 14:07:15,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:15,930 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, 1] [2025-03-03 14:07:15,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:16,130 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-03 14:07:16,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1023406131, now seen corresponding path program 4 times [2025-03-03 14:07:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350218851] [2025-03-03 14:07:16,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:07:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:16,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 199 statements into 2 equivalence classes. [2025-03-03 14:07:16,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:07:16,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:07:16,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275351684] [2025-03-03 14:07:16,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:07:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:16,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:16,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:07:16,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 199 statements into 2 equivalence classes. [2025-03-03 14:07:16,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:07:16,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:07:16,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:07:16,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:07:16,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 14:07:16,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:07:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:07:16,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:07:16,377 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:07:16,378 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:07:16,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:07:16,579 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-03 14:07:16,582 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:16,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:07:16,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:07:16 BoogieIcfgContainer [2025-03-03 14:07:16,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:07:16,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:07:16,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:07:16,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:07:16,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:10" (3/4) ... [2025-03-03 14:07:16,644 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:07:16,717 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 151. [2025-03-03 14:07:16,806 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:07:16,807 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:07:16,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:07:16,809 INFO L158 Benchmark]: Toolchain (without parser) took 6911.59ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 37.9MB in the end (delta: 71.5MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,809 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:16,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.00ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 97.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.25ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,809 INFO L158 Benchmark]: Boogie Preprocessor took 24.65ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:16,809 INFO L158 Benchmark]: IcfgBuilder took 185.45ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 83.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,810 INFO L158 Benchmark]: TraceAbstraction took 6363.78ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 53.2MB in the end (delta: 30.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,810 INFO L158 Benchmark]: Witness Printer took 164.51ms. Allocated memory is still 142.6MB. Free memory was 53.2MB in the beginning and 37.9MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:16,814 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.00ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 97.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.25ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.65ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 185.45ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 83.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6363.78ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 53.2MB in the end (delta: 30.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 164.51ms. Allocated memory is still 142.6MB. Free memory was 53.2MB in the beginning and 37.9MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; VAL [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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 936 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 738 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 198 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 528 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=9, InterpolantAutomatonStates: 111, 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, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 838 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127 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-03 14:07:16,840 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