./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:29:59,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:29:59,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:29:59,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:29:59,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:29:59,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:29:59,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:29:59,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:29:59,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:29:59,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:29:59,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:29:59,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:29:59,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:29:59,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:29:59,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:29:59,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:29:59,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:29:59,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:29:59,837 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2025-03-16 18:30:00,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:30:00,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:30:00,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:30:00,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:30:00,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:30:00,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2025-03-16 18:30:01,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3754bfc7/96806931280e4400b6249e8f19db1838/FLAG2acd78a40 [2025-03-16 18:30:01,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:30:01,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2025-03-16 18:30:01,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3754bfc7/96806931280e4400b6249e8f19db1838/FLAG2acd78a40 [2025-03-16 18:30:01,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3754bfc7/96806931280e4400b6249e8f19db1838 [2025-03-16 18:30:01,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:30:01,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:30:01,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:30:01,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:30:01,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:30:01,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f17b327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01, skipping insertion in model container [2025-03-16 18:30:01,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:30:01,692 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/verifythis/lcp.c[515,528] [2025-03-16 18:30:01,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:30:01,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:30:01,736 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/verifythis/lcp.c[515,528] [2025-03-16 18:30:01,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:30:01,761 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:30:01,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01 WrapperNode [2025-03-16 18:30:01,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:30:01,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:30:01,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:30:01,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:30:01,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,789 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2025-03-16 18:30:01,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:30:01,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:30:01,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:30:01,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:30:01,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,813 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-16 18:30:01,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:30:01,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:30:01,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:30:01,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:30:01,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (1/1) ... [2025-03-16 18:30:01,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:30:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:01,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:30:01,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:30:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:30:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 18:30:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 18:30:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:30:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:30:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:30:01,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:30:01,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:30:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 18:30:01,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:30:01,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:30:02,097 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-16 18:30:02,097 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:30:02,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:30:02,105 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:30:02,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:30:02 BoogieIcfgContainer [2025-03-16 18:30:02,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:30:02,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:30:02,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:30:02,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:30:02,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:30:01" (1/3) ... [2025-03-16 18:30:02,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e070a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:30:02, skipping insertion in model container [2025-03-16 18:30:02,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:01" (2/3) ... [2025-03-16 18:30:02,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e070a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:30:02, skipping insertion in model container [2025-03-16 18:30:02,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:30:02" (3/3) ... [2025-03-16 18:30:02,114 INFO L128 eAbstractionObserver]: Analyzing ICFG lcp.c [2025-03-16 18:30:02,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:30:02,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcp.c that has 3 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:30:02,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:30:02,185 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;@4d706a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:30:02,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:30:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 18:30:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 18:30:02,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:02,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:02,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1352377912, now seen corresponding path program 1 times [2025-03-16 18:30:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:02,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267512554] [2025-03-16 18:30:02,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:02,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 18:30:02,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 18:30:02,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:02,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:30:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:02,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267512554] [2025-03-16 18:30:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267512554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650086659] [2025-03-16 18:30:02,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:02,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:02,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:02,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:30:02,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:30:02,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 18:30:02,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 18:30:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:02,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 18:30:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:30:02,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:30:02,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650086659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:02,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:30:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 18:30:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147779064] [2025-03-16 18:30:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:30:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:30:02,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:30:02,473 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:30:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:02,488 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2025-03-16 18:30:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:30:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-16 18:30:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:02,495 INFO L225 Difference]: With dead ends: 54 [2025-03-16 18:30:02,495 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 18:30:02,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:30:02,500 INFO L435 NwaCegarLoop]: 33 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, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:02,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 18:30:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 18:30:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-16 18:30:02,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 25 [2025-03-16 18:30:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-16 18:30:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:30:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-16 18:30:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:30:02,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:02,530 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:02,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 18:30:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 18:30:02,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1283323240, now seen corresponding path program 1 times [2025-03-16 18:30:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727268254] [2025-03-16 18:30:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:02,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:30:02,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:30:02,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:02,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:30:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727268254] [2025-03-16 18:30:03,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727268254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:03,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:30:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390663627] [2025-03-16 18:30:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:03,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:30:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:03,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:30:03,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:30:03,069 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:30:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:03,175 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-16 18:30:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:30:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2025-03-16 18:30:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:03,176 INFO L225 Difference]: With dead ends: 47 [2025-03-16 18:30:03,176 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:30:03,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:30:03,177 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:03,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 66 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:30:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-16 18:30:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-16 18:30:03,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 27 [2025-03-16 18:30:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:03,183 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-16 18:30:03,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:30:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-16 18:30:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 18:30:03,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:03,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:03,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:30:03,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1576726247, now seen corresponding path program 1 times [2025-03-16 18:30:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132247513] [2025-03-16 18:30:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:03,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 18:30:03,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:30:03,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:30:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132247513] [2025-03-16 18:30:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132247513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:03,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:03,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:30:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393861495] [2025-03-16 18:30:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:03,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:30:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:03,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:30:03,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:30:03,389 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:30:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:03,486 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-16 18:30:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:30:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2025-03-16 18:30:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:03,487 INFO L225 Difference]: With dead ends: 34 [2025-03-16 18:30:03,487 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:30:03,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:30:03,488 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:03,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 103 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:30:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-16 18:30:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-16 18:30:03,495 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2025-03-16 18:30:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-16 18:30:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:30:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-16 18:30:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 18:30:03,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:03,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:30:03,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1032080861, now seen corresponding path program 1 times [2025-03-16 18:30:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802523753] [2025-03-16 18:30:03,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:30:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802523753] [2025-03-16 18:30:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802523753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:03,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:30:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638597384] [2025-03-16 18:30:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:03,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:30:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:03,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:30:03,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:30:03,807 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:30:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:03,883 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-16 18:30:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:30:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-16 18:30:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:03,884 INFO L225 Difference]: With dead ends: 44 [2025-03-16 18:30:03,884 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:30:03,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:30:03,885 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:03,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 103 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:30:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-16 18:30:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-16 18:30:03,888 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 34 [2025-03-16 18:30:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:03,889 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-16 18:30:03,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:30:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-16 18:30:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 18:30:03,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:03,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:30:03,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:03,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1639257838, now seen corresponding path program 1 times [2025-03-16 18:30:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:03,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829400861] [2025-03-16 18:30:03,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:03,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:30:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829400861] [2025-03-16 18:30:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829400861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191530095] [2025-03-16 18:30:04,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:04,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:04,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:30:04,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:30:04,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:04,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:04,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:04,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:04,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 18:30:04,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:04,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-03-16 18:30:04,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2025-03-16 18:30:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:30:04,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191530095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:08,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:30:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-16 18:30:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290739738] [2025-03-16 18:30:08,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:08,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:30:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:08,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:30:08,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:30:08,276 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:30:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:08,303 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-03-16 18:30:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:30:08,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2025-03-16 18:30:08,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:08,303 INFO L225 Difference]: With dead ends: 38 [2025-03-16 18:30:08,303 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 18:30:08,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:30:08,304 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:08,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 18:30:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 18:30:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:30:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 18:30:08,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-03-16 18:30:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 18:30:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:30:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 18:30:08,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 18:30:08,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:30:08,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 18:30:08,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:08,513 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 18:30:08,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 18:30:08,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:30:08,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown expressions could not be backtranslated (possibly during translation to Boogie) [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!base [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown expressions could not be backtranslated (possibly during translation to Boogie) [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-16 18:30:08,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-16 18:30:08,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:30:08 BoogieIcfgContainer [2025-03-16 18:30:08,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:30:08,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:30:08,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:30:08,635 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:30:08,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:30:02" (3/4) ... [2025-03-16 18:30:08,637 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 18:30:08,641 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-16 18:30:08,641 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-16 18:30:08,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-16 18:30:08,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-16 18:30:08,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-16 18:30:08,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:30:08,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:30:08,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:30:08,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:30:08,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:30:08,713 INFO L158 Benchmark]: Toolchain (without parser) took 7166.30ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 126.5MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:30:08,713 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:30:08,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.15ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 111.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:30:08,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.3MB in the end (delta: 984.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:30:08,714 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 109.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:30:08,714 INFO L158 Benchmark]: IcfgBuilder took 284.49ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 93.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:30:08,715 INFO L158 Benchmark]: TraceAbstraction took 6525.64ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 133.8MB in the end (delta: -40.6MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2025-03-16 18:30:08,716 INFO L158 Benchmark]: Witness Printer took 77.26ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 126.5MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:30:08,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.15ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 111.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.3MB in the end (delta: 984.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 109.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 284.49ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 93.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6525.64ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 133.8MB in the end (delta: -40.6MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * Witness Printer took 77.26ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 126.5MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown expressions could not be backtranslated (possibly during translation to Boogie) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown expressions could not be backtranslated (possibly during translation to Boogie) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 41 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 118 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 205 ConstructedInterpolants, 4 QuantifiedInterpolants, 623 SizeOfPredicates, 7 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 88/96 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Location Invariant Derived location invariant: ((((y == y) && (x == x)) && (n == n)) || ((((y == y) && (x == x)) && (n == n)) && ((n < (((long long) l + y) + 1)) || (n < (((long long) l + x) + 1))))) RESULT: Ultimate proved your program to be correct! [2025-03-16 18:30:08,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE